Base | Representation |
---|---|
bin | 1001001100100110100011… |
… | …0110111000011101101101 |
3 | 1022210201010111011202012102 |
4 | 2103021220312320131231 |
5 | 2311134101212413201 |
6 | 33301235031144445 |
7 | 2062401365526362 |
oct | 223115066703555 |
9 | 38721114152172 |
10 | 10112112232301 |
11 | 3249582807562 |
12 | 1173965b15125 |
13 | 584750136c11 |
14 | 26d600a64469 |
15 | 12808c6bc26b |
hex | 93268db876d |
10112112232301 has 32 divisors (see below), whose sum is σ = 10804492800000. Its totient is φ = 9436873807872.
The previous prime is 10112112232291. The next prime is 10112112232307. The reversal of 10112112232301 is 10323221121101.
It is a cyclic number.
It is not a de Polignac number, because 10112112232301 - 218 = 10112111970157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112112232307) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1322013725 + ... + 1322021373.
It is an arithmetic number, because the mean of its divisors is an integer number (337640400000).
Almost surely, 210112112232301 is an apocalyptic number.
It is an amenable number.
10112112232301 is a deficient number, since it is larger than the sum of its proper divisors (692380567699).
10112112232301 is a wasteful number, since it uses less digits than its factorization.
10112112232301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11621.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 10112112232301 its reverse (10323221121101), we get a palindrome (20435333353402).
The spelling of 10112112232301 in words is "ten trillion, one hundred twelve billion, one hundred twelve million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •