Base | Representation |
---|---|
bin | 1001001100000001010010… |
… | …1111101011001001011100 |
3 | 1022202202022111022201001020 |
4 | 2103000110233223021130 |
5 | 2311003110421401022 |
6 | 33252502404444140 |
7 | 2061565505511420 |
oct | 223002457531134 |
9 | 38682274281036 |
10 | 10102111122012 |
11 | 3245310404358 |
12 | 1171a346a9650 |
13 | 58381814b290 |
14 | 26cd326d2b80 |
15 | 127ba469035c |
hex | 93014beb25c |
10102111122012 has 48 divisors (see below), whose sum is σ = 29011190917632. Its totient is φ = 2664293042880.
The previous prime is 10102111121981. The next prime is 10102111122071. The reversal of 10102111122012 is 21022111120101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10102111121982 and 10102111122000.
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, 4625507664 + ... + 4625509847.
It is an arithmetic number, because the mean of its divisors is an integer number (604399810784).
Almost surely, 210102111122012 is an apocalyptic number.
10102111122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10102111122012 is an abundant number, since it is smaller than the sum of its proper divisors (18909079795620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102111122012 is a wasteful number, since it uses less digits than its factorization.
10102111122012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9251017538 (or 9251017536 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10102111122012 its reverse (21022111120101), we get a palindrome (31124222242113).
The spelling of 10102111122012 in words is "ten trillion, one hundred two billion, one hundred eleven million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •