Base | Representation |
---|---|
bin | 11001000000101111100010… |
… | …001011100100000110000110 |
3 | 112102111002220121012001120010 |
4 | 121000233202023210012012 |
5 | 103404234002214200402 |
6 | 1025542151454251050 |
7 | 32112253054203504 |
oct | 3100574213440606 |
9 | 472432817161503 |
10 | 110002202100102 |
11 | 32060743374634 |
12 | 104071b6ab6a86 |
13 | 494c217589980 |
14 | 1d241c65a7674 |
15 | cab622be6a6c |
hex | 640be22e4186 |
110002202100102 has 64 divisors (see below), whose sum is σ = 242441198689536. Its totient is φ = 33059228146560.
The previous prime is 110002202100101. The next prime is 110002202100113. The reversal of 110002202100102 is 201001202200011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002202100101) 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 in 31 ways as a sum of consecutive naturals, for example, 291646428 + ... + 292023360.
It is an arithmetic number, because the mean of its divisors is an integer number (3788143729524).
Almost surely, 2110002202100102 is an apocalyptic number.
110002202100102 is an abundant number, since it is smaller than the sum of its proper divisors (132438996589434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002202100102 is a wasteful number, since it uses less digits than its factorization.
110002202100102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464005.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110002202100102 its reverse (201001202200011), we get a palindrome (311003404300113).
Subtracting 110002202100102 from its reverse (201001202200011), we obtain a palindrome (90999000099909).
The spelling of 110002202100102 in words is "one hundred ten trillion, two billion, two hundred two million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •