Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0001110001100011010 |
3 | 101112012012112202100001 |
4 | 1212202212032030122 |
5 | 3300442120023002 |
6 | 122325154203214 |
7 | 10645301334112 |
oct | 1464246161432 |
9 | 345165482301 |
10 | 110102111002 |
11 | 4276a853674 |
12 | 19408b8350a |
13 | a4c86cc510 |
14 | 54869a4042 |
15 | 2ce6067a87 |
hex | 19a298e31a |
110102111002 has 64 divisors (see below), whose sum is σ = 181812234240. Its totient is φ = 49702693824.
The previous prime is 110102110991. The next prime is 110102111023. The reversal of 110102111002 is 200111201011.
It is a self number, because there is not a number n which added to its sum of digits gives 110102111002.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 84498283 + ... + 84499585.
It is an arithmetic number, because the mean of its divisors is an integer number (2840816160).
Almost surely, 2110102111002 is an apocalyptic number.
110102111002 is a deficient number, since it is larger than the sum of its proper divisors (71710123238).
110102111002 is a wasteful number, since it uses less digits than its factorization.
110102111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1787.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110102111002 its reverse (200111201011), we get a palindrome (310213312013).
Subtracting 110102111002 from its reverse (200111201011), we obtain a palindrome (90009090009).
The spelling of 110102111002 in words is "one hundred ten billion, one hundred two million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •