Base | Representation |
---|---|
bin | 1001010010011011000111… |
… | …0110011011111101010000 |
3 | 1100011021021021111121210120 |
4 | 2110212301312123331100 |
5 | 2314303411000200422 |
6 | 33415214512230240 |
7 | 2102541611060511 |
oct | 224466166337520 |
9 | 40137237447716 |
10 | 10212121100112 |
11 | 3287a3314a128 |
12 | 118b21683b380 |
13 | 590cca72ca89 |
14 | 2743aad52a08 |
15 | 12a9925a945c |
hex | 949b1d9bf50 |
10212121100112 has 40 divisors (see below), whose sum is σ = 27094321301856. Its totient is φ = 3312039275136.
The previous prime is 10212121100003. The next prime is 10212121100131. The reversal of 10212121100112 is 21100112121201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10212121100091 and 10212121100100.
It is a congruent number.
It is an unprimeable number.
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, 2875032318 + ... + 2875035869.
Almost surely, 210212121100112 is an apocalyptic number.
10212121100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10212121100112 is an abundant number, since it is smaller than the sum of its proper divisors (16882200201744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212121100112 is a wasteful number, since it uses less digits than its factorization.
10212121100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5750068235 (or 5750068229 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10212121100112 its reverse (21100112121201), we get a palindrome (31312233221313).
The spelling of 10212121100112 in words is "ten trillion, two hundred twelve billion, one hundred twenty-one million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •