Base | Representation |
---|---|

bin | 10000001000100011111001 |

3 | 21221212121022 |

4 | 100020203321 |

5 | 2040314434 |

6 | 230352225 |

7 | 50643344 |

oct | 20104371 |

9 | 7855538 |

10 | 4229369 |

11 | 2429651 |

12 | 14bb675 |

13 | b510b1 |

14 | 7c145b |

15 | 58822e |

hex | 4088f9 |

4229369 has 4 divisors (see below), whose sum is σ = 4276980. Its totient is φ = 4181760.

The previous prime is 4229339. The next prime is 4229383. The reversal of 4229369 is 9639224.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 2371600 + 1857769 = 1540^2 + 1363^2 .

It is a cyclic number.

It is not a de Polignac number, because 4229369 - 2^{16} = 4163833 is a prime.

It is a super-2 number, since 2×4229369^{2} = 35775124276322, which contains 22 as substring.

It is a d-powerful number, because it can be written as **4**^{11} + **2**^{11} + **2**^{15} + **9**^{2} + **3**^{4} + **6** + **9**^{2} .

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (4229339) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23672 + ... + 23849.

It is an arithmetic number, because the mean of its divisors is an integer number (1069245).

Almost surely, 2^{4229369} is an apocalyptic number.

It is an amenable number.

4229369 is a deficient number, since it is larger than the sum of its proper divisors (47611).

4229369 is an equidigital number, since it uses as much as digits as its factorization.

4229369 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 47610.

The product of its digits is 23328, while the sum is 35.

The square root of 4229369 is about 2056.5429730497. The cubic root of 4229369 is about 161.7180611506.

The spelling of 4229369 in words is "four million, two hundred twenty-nine thousand, three hundred sixty-nine".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •