Base | Representation |
---|---|
bin | 1001001101000111101111… |
… | …0111111011111000000000 |
3 | 1022211120010100222201020120 |
4 | 2103101323313323320000 |
5 | 2311310322412210422 |
6 | 33305311041340240 |
7 | 2063135224556541 |
oct | 223217367737000 |
9 | 38746110881216 |
10 | 10121021210112 |
11 | 325233468943a |
12 | 1175631637680 |
13 | 58553ca97c17 |
14 | 26dc07d444c8 |
15 | 12840e8b945c |
hex | 9347bdfbe00 |
10121021210112 has 80 divisors (see below), whose sum is σ = 28382140152960. Its totient is φ = 3196111951872.
The previous prime is 10121021210029. The next prime is 10121021210141. The reversal of 10121021210112 is 21101212012101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10121021210091 and 10121021210100.
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, 173370988 + ... + 173429355.
It is an arithmetic number, because the mean of its divisors is an integer number (354776751912).
Almost surely, 210121021210112 is an apocalyptic number.
10121021210112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10121021210112 is an abundant number, since it is smaller than the sum of its proper divisors (18261118942848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121021210112 is an equidigital number, since it uses as much as digits as its factorization.
10121021210112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346800383 (or 346800367 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10121021210112 its reverse (21101212012101), we get a palindrome (31222233222213).
The spelling of 10121021210112 in words is "ten trillion, one hundred twenty-one billion, twenty-one million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •