Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1000111100110111001 |
3 | 101111221002121120021111 |
4 | 1212130201013212321 |
5 | 3300240012010014 |
6 | 122311112040321 |
7 | 10642622336116 |
oct | 1463441074671 |
9 | 344832546244 |
10 | 110000110009 |
11 | 42718215829 |
12 | 1939a9930a1 |
13 | a4b0537cba |
14 | 547721190d |
15 | 2cdc11a2c4 |
hex | 199c8479b9 |
110000110009 has 2 divisors, whose sum is σ = 110000110010. Its totient is φ = 110000110008.
The previous prime is 110000109889. The next prime is 110000110037. The reversal of 110000110009 is 900011000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79594515625 + 30405594384 = 282125^2 + 174372^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000110009 - 29 = 110000109497 is a prime.
It is not a weakly prime, because it can be changed into another prime (110000110609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000055004 + 55000055005.
It is an arithmetic number, because the mean of its divisors is an integer number (55000055005).
Almost surely, 2110000110009 is an apocalyptic number.
It is an amenable number.
110000110009 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000110009 is an equidigital number, since it uses as much as digits as its factorization.
110000110009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 13.
The spelling of 110000110009 in words is "one hundred ten billion, one hundred ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •