Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1110000111011110000000 |
3 | 1022102002100200000001022202 |
4 | 2101202022232013132000 |
5 | 2302324032332210422 |
6 | 33134222350452332 |
7 | 2051356244444606 |
oct | 221421256073600 |
9 | 38362320001282 |
10 | 10001011210112 |
11 | 320645011415a |
12 | 115631a5040a8 |
13 | 5771257bbcc0 |
14 | 2680a1557876 |
15 | 125238adab92 |
hex | 9188ab87780 |
10001011210112 has 32 divisors (see below), whose sum is σ = 21456496409880. Its totient is φ = 4615851326976.
The previous prime is 10001011210081. The next prime is 10001011210117. The reversal of 10001011210112 is 21101211010001.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×100010112101122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10001011210093 and 10001011210102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001011210117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3005109878 + ... + 3005113205.
Almost surely, 210001011210112 is an apocalyptic number.
It is an amenable number.
10001011210112 is an abundant number, since it is smaller than the sum of its proper divisors (11455485199768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001011210112 is an equidigital number, since it uses as much as digits as its factorization.
10001011210112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6010223110 (or 6010223098 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10001011210112 its reverse (21101211010001), we get a palindrome (31102222220113).
The spelling of 10001011210112 in words is "ten trillion, one billion, eleven million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •