Base | Representation |
---|---|
bin | 1001001100100110100011… |
… | …0110110011100000100001 |
3 | 1022210201010111010201100120 |
4 | 2103021220312303200201 |
5 | 2311134101211241001 |
6 | 33301235030510453 |
7 | 2062401365413242 |
oct | 223115066634041 |
9 | 38721114121316 |
10 | 10112112212001 |
11 | 32495827a3288 |
12 | 1173965b05429 |
13 | 58475012a8c7 |
14 | 26d600a5acc9 |
15 | 12808c6b6236 |
hex | 93268db3821 |
10112112212001 has 8 divisors (see below), whose sum is σ = 13483268799840. Its totient is φ = 6741181882752.
The previous prime is 10112112211987. The next prime is 10112112212003. The reversal of 10112112212001 is 10021221121101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10112112212001 - 227 = 10111977994273 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10112112212003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56460336 + ... + 56639153.
It is an arithmetic number, because the mean of its divisors is an integer number (1685408599980).
Almost surely, 210112112212001 is an apocalyptic number.
It is an amenable number.
10112112212001 is a deficient number, since it is larger than the sum of its proper divisors (3371156587839).
10112112212001 is a wasteful number, since it uses less digits than its factorization.
10112112212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113129295.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10112112212001 its reverse (10021221121101), we get a palindrome (20133333333102).
The spelling of 10112112212001 in words is "ten trillion, one hundred twelve billion, one hundred twelve million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •