Base | Representation |
---|---|
bin | 111010010101101111001… |
… | …010001101001100001001 |
3 | 112012021002221102122221122 |
4 | 322111233022031030021 |
5 | 1011141033233333414 |
6 | 12305424023245025 |
7 | 562434322631402 |
oct | 72255712151411 |
9 | 15167087378848 |
10 | 4009069433609 |
11 | 13062671a7349 |
12 | 548b992a9775 |
13 | 231090a797b6 |
14 | dc07ba6a9a9 |
15 | 6e4422eeb8e |
hex | 3a56f28d309 |
4009069433609 has 4 divisors (see below), whose sum is σ = 4138394254080. Its totient is φ = 3879744613140.
The previous prime is 4009069433561. The next prime is 4009069433689. The reversal of 4009069433609 is 9063349609004.
It is a happy number.
4009069433609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4009069433609 - 212 = 4009069429513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4009069433689) 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, 64662410189 + ... + 64662410250.
It is an arithmetic number, because the mean of its divisors is an integer number (1034598563520).
Almost surely, 24009069433609 is an apocalyptic number.
It is an amenable number.
4009069433609 is a deficient number, since it is larger than the sum of its proper divisors (129324820471).
4009069433609 is a wasteful number, since it uses less digits than its factorization.
4009069433609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129324820470.
The product of its (nonzero) digits is 3779136, while the sum is 53.
The spelling of 4009069433609 in words is "four trillion, nine billion, sixty-nine million, four hundred thirty-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •