Base | Representation |
---|---|
bin | 11001000011100111110101… |
… | …111011110011110010011100 |
3 | 112110012000201120210010001002 |
4 | 121003213311323303302130 |
5 | 103421004302103310022 |
6 | 1030213121124205432 |
7 | 32132460154530050 |
oct | 3103476573636234 |
9 | 473160646703032 |
10 | 110200102010012 |
11 | 32127667745a93 |
12 | 10439627239878 |
13 | 4964a95788c91 |
14 | 1d2d9db7b7c60 |
15 | cb1856ad7092 |
hex | 6439f5ef3c9c |
110200102010012 has 48 divisors (see below), whose sum is σ = 242087180643840. Its totient is φ = 42797555140032.
The previous prime is 110200102010003. The next prime is 110200102010071. The reversal of 110200102010012 is 210010201002011.
It is a super-3 number, since 3×1102001020100123 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110200102009975 and 110200102010002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4503097523 + ... + 4503121994.
It is an arithmetic number, because the mean of its divisors is an integer number (5043482930080).
Almost surely, 2110200102010012 is an apocalyptic number.
It is an amenable number.
110200102010012 is an abundant number, since it is smaller than the sum of its proper divisors (131887078633828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200102010012 is a wasteful number, since it uses less digits than its factorization.
110200102010012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9006219570 (or 9006219568 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110200102010012 its reverse (210010201002011), we get a palindrome (320210303012023).
The spelling of 110200102010012 in words is "one hundred ten trillion, two hundred billion, one hundred two million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •