Base | Representation |
---|---|
bin | 10101001101110000… |
… | …01110100001100111 |
3 | 1002101202201022011201 |
4 | 22212320032201213 |
5 | 141311230121012 |
6 | 5122104343331 |
7 | 552150533101 |
oct | 124670164147 |
9 | 32352638151 |
10 | 11389692007 |
11 | 4915203201 |
12 | 225a474b47 |
13 | 10c689a135 |
14 | 7a0950571 |
15 | 469db8857 |
hex | 2a6e0e867 |
11389692007 has 2 divisors, whose sum is σ = 11389692008. Its totient is φ = 11389692006.
The previous prime is 11389691969. The next prime is 11389692019. The reversal of 11389692007 is 70029698311.
It is a happy number.
11389692007 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11389692007 - 211 = 11389689959 is a prime.
It is the 106723-rd Hogben number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11389692107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5694846003 + 5694846004.
It is an arithmetic number, because the mean of its divisors is an integer number (5694846004).
Almost surely, 211389692007 is an apocalyptic number.
11389692007 is a deficient number, since it is larger than the sum of its proper divisors (1).
11389692007 is an equidigital number, since it uses as much as digits as its factorization.
11389692007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 46.
The spelling of 11389692007 in words is "eleven billion, three hundred eighty-nine million, six hundred ninety-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •