Base | Representation |
---|---|
bin | 1001001100011111100000… |
… | …0101011011011011010000 |
3 | 1022210112020122000120101220 |
4 | 2103013320011123123100 |
5 | 2311121212334020422 |
6 | 33300323202525040 |
7 | 2062303452636015 |
oct | 223077005333320 |
9 | 38715218016356 |
10 | 10110220220112 |
11 | 32487a1817821 |
12 | 1173518366780 |
13 | 58450b16c08c |
14 | 26d4a167970c |
15 | 127ecb53ae5c |
hex | 931f815b6d0 |
10110220220112 has 20 divisors (see below), whose sum is σ = 26118068902080. Its totient is φ = 3370073406688.
The previous prime is 10110220220099. The next prime is 10110220220141. The reversal of 10110220220112 is 21102202201101.
It is a junction number, because it is equal to n+sod(n) for n = 10110220220091 and 10110220220100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105314793912 + ... + 105314794007.
It is an arithmetic number, because the mean of its divisors is an integer number (1305903445104).
Almost surely, 210110220220112 is an apocalyptic number.
10110220220112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110220220112 is an abundant number, since it is smaller than the sum of its proper divisors (16007848681968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110220220112 is a wasteful number, since it uses less digits than its factorization.
10110220220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210629587930 (or 210629587924 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10110220220112 its reverse (21102202201101), we get a palindrome (31212422421213).
The spelling of 10110220220112 in words is "ten trillion, one hundred ten billion, two hundred twenty million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •