Base | Representation |
---|---|
bin | 1001001011111001110101… |
… | …1110000100110110101100 |
3 | 1022202120011000220012011100 |
4 | 2102332131132010312230 |
5 | 2310440011131120022 |
6 | 33251532042123100 |
7 | 2061465066436665 |
oct | 222763536046654 |
9 | 38676130805140 |
10 | 10100110020012 |
11 | 3244483884851 |
12 | 11715764b0490 |
13 | 5835896a945c |
14 | 26cbc2a2c36c |
15 | 127ad8b611ac |
hex | 92f9d784dac |
10100110020012 has 72 divisors (see below), whose sum is σ = 25683396940656. Its totient is φ = 3346592667264.
The previous prime is 10100110019981. The next prime is 10100110020029. The reversal of 10100110020012 is 21002001100101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10100110019976 and 10100110020003.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32461203 + ... + 32770869.
It is an arithmetic number, because the mean of its divisors is an integer number (356713846398).
Almost surely, 210100110020012 is an apocalyptic number.
10100110020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10100110020012 is an abundant number, since it is smaller than the sum of its proper divisors (15583286920644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100110020012 is a wasteful number, since it uses less digits than its factorization.
10100110020012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315087 (or 315082 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10100110020012 its reverse (21002001100101), we get a palindrome (31102111120113).
The spelling of 10100110020012 in words is "ten trillion, one hundred billion, one hundred ten million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •