Base | Representation |
---|---|
bin | 11001000000101111100011… |
… | …010000001110110110001001 |
3 | 112102111002221212001121011002 |
4 | 121000233203100032312021 |
5 | 103404234021321213001 |
6 | 1025542153340144345 |
7 | 32112253363205324 |
oct | 3100574320166611 |
9 | 472432855047132 |
10 | 110002220101001 |
11 | 32060752549a08 |
12 | 10407200b380b5 |
13 | 494c21b2201a7 |
14 | 1d241c8b317bb |
15 | cab6245a046b |
hex | 640be340ed89 |
110002220101001 has 2 divisors, whose sum is σ = 110002220101002. Its totient is φ = 110002220101000.
The previous prime is 110002220100967. The next prime is 110002220101019. The reversal of 110002220101001 is 100101022200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107199103690000 + 2803116411001 = 10353700^2 + 1674251^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110002220101001 is a prime.
It is not a weakly prime, because it can be changed into another prime (110002220101051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001110050500 + 55001110050501.
It is an arithmetic number, because the mean of its divisors is an integer number (55001110050501).
Almost surely, 2110002220101001 is an apocalyptic number.
It is an amenable number.
110002220101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002220101001 is an equidigital number, since it uses as much as digits as its factorization.
110002220101001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110002220101001 its reverse (100101022200011), we get a palindrome (210103242301012).
The spelling of 110002220101001 in words is "one hundred ten trillion, two billion, two hundred twenty million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •