Base | Representation |
---|---|
bin | 11001000011100111110000… |
… | …100000101011100000000110 |
3 | 112110012000111020112221101010 |
4 | 121003213300200223200012 |
5 | 103421004110304341402 |
6 | 1030213104113543050 |
7 | 32132455001210034 |
oct | 3103476040534006 |
9 | 473160436487333 |
10 | 110200011012102 |
11 | 32127620342a00 |
12 | 10439600874a86 |
13 | 4964a7c977a6b |
14 | 1d2d9cd68b554 |
15 | cb184db0ea6c |
hex | 6439f082b806 |
110200011012102 has 24 divisors (see below), whose sum is σ = 242257875449688. Its totient is φ = 33393942730720.
The previous prime is 110200011012089. The next prime is 110200011012209. The reversal of 110200011012102 is 201210110002011.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 75895323663 + ... + 75895325114.
It is an arithmetic number, because the mean of its divisors is an integer number (10094078143737).
Almost surely, 2110200011012102 is an apocalyptic number.
110200011012102 is an abundant number, since it is smaller than the sum of its proper divisors (132057864437586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200011012102 is a wasteful number, since it uses less digits than its factorization.
110200011012102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151790648804 (or 151790648793 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110200011012102 its reverse (201210110002011), we get a palindrome (311410121014113).
The spelling of 110200011012102 in words is "one hundred ten trillion, two hundred billion, eleven million, twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •