Base | Representation |
---|---|
bin | 1001001100100110001101… |
… | …1010110110111110110000 |
3 | 1022210200220010111200011110 |
4 | 2103021203122312332300 |
5 | 2311133404334000422 |
6 | 33301222011513320 |
7 | 2062366210212333 |
oct | 223114332667660 |
9 | 38720803450143 |
10 | 10112021000112 |
11 | 3249536264459 |
12 | 117393b458840 |
13 | 584737273185 |
14 | 26d5d28b661a |
15 | 12808469a60c |
hex | 932636b6fb0 |
10112021000112 has 40 divisors (see below), whose sum is σ = 26193900038656. Its totient is φ = 3361489263936.
The previous prime is 10112021000111. The next prime is 10112021000119. The reversal of 10112021000112 is 21100012021101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10112021000111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 286994788 + ... + 287030019.
Almost surely, 210112021000112 is an apocalyptic number.
10112021000112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10112021000112 is an abundant number, since it is smaller than the sum of its proper divisors (16081879038544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112021000112 is a wasteful number, since it uses less digits than its factorization.
10112021000112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574025185 (or 574025179 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10112021000112 its reverse (21100012021101), we get a palindrome (31212033021213).
The spelling of 10112021000112 in words is "ten trillion, one hundred twelve billion, twenty-one million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •