Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …1000000001011011010000 |
3 | 1022210121022111201211020220 |
4 | 2103020213320001123100 |
5 | 2311124333113341422 |
6 | 33300534524033040 |
7 | 2062332360025020 |
oct | 223104770013320 |
9 | 38717274654226 |
10 | 10111022012112 |
11 | 3249073371a3a |
12 | 1173700992780 |
13 | 5846082cb808 |
14 | 26d539d4da80 |
15 | 128026b18e5c |
hex | 93227e016d0 |
10111022012112 has 40 divisors (see below), whose sum is σ = 29851588798656. Its totient is φ = 2888863431936.
The previous prime is 10111022012093. The next prime is 10111022012129. The reversal of 10111022012112 is 21121022011101.
It is a happy number.
It is a super-2 number, since 2×101110220121122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10111022012091 and 10111022012100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15046163373 + ... + 15046164044.
Almost surely, 210111022012112 is an apocalyptic number.
10111022012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10111022012112 is an abundant number, since it is smaller than the sum of its proper divisors (19740566786544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111022012112 is a wasteful number, since it uses less digits than its factorization.
10111022012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30092327435 (or 30092327429 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10111022012112 its reverse (21121022011101), we get a palindrome (31232044023213).
The spelling of 10111022012112 in words is "ten trillion, one hundred eleven billion, twenty-two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •