Base | Representation |
---|---|
bin | 1001010001110001101100… |
… | …0110011110110111010000 |
3 | 1100010012120100222102112111 |
4 | 2110130123012132313100 |
5 | 2314113123003341422 |
6 | 33410135311435104 |
7 | 2101666224302362 |
oct | 224343306366720 |
9 | 40105510872474 |
10 | 10201002012112 |
11 | 32832477727aa |
12 | 1189032b25a94 |
13 | 58cc47c3a672 |
14 | 273a34322d32 |
15 | 12a541344a77 |
hex | 9471b19edd0 |
10201002012112 has 10 divisors (see below), whose sum is σ = 19764441398498. Its totient is φ = 5100501006048.
The previous prime is 10201002012101. The next prime is 10201002012167. The reversal of 10201002012112 is 21121020010201.
10201002012112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 7842553807936 + 2358448204176 = 2800456^2 + 1535724^2 .
It is a super-2 number, since 2×102010020121122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10201002012092 and 10201002012101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 318781312863 + ... + 318781312894.
Almost surely, 210201002012112 is an apocalyptic number.
It is an amenable number.
10201002012112 is a deficient number, since it is larger than the sum of its proper divisors (9563439386386).
10201002012112 is an equidigital number, since it uses as much as digits as its factorization.
10201002012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637562625765 (or 637562625759 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10201002012112 its reverse (21121020010201), we get a palindrome (31322022022313).
The spelling of 10201002012112 in words is "ten trillion, two hundred one billion, two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •