Base | Representation |
---|---|
bin | 1001001100100110001000… |
… | …1010110100111010000101 |
3 | 1022210200211200000210000000 |
4 | 2103021202022310322011 |
5 | 2311133334001120401 |
6 | 33301215542111513 |
7 | 2062365533662200 |
oct | 223114212647205 |
9 | 38720750023000 |
10 | 10112000020101 |
11 | 3249525434901 |
12 | 117393441b599 |
13 | 584732b08975 |
14 | 26d5cdbb4937 |
15 | 128082904186 |
hex | 932622b4e85 |
10112000020101 has 96 divisors (see below), whose sum is σ = 18408754656000. Its totient is φ = 5527054564416.
The previous prime is 10112000020099. The next prime is 10112000020139. The reversal of 10112000020101 is 10102000021101.
It is a happy number.
It is not a de Polignac number, because 10112000020101 - 21 = 10112000020099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112000020141) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 413425 + ... + 4516073.
It is an arithmetic number, because the mean of its divisors is an integer number (191757861000).
Almost surely, 210112000020101 is an apocalyptic number.
It is an amenable number.
10112000020101 is a deficient number, since it is larger than the sum of its proper divisors (8296754635899).
10112000020101 is an frugal number, since it uses more digits than its factorization.
10112000020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4102707 (or 4102682 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10112000020101 its reverse (10102000021101), we get a palindrome (20214000041202).
The spelling of 10112000020101 in words is "ten trillion, one hundred twelve billion, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •