Base | Representation |
---|---|
bin | 1001000110110010000001… |
… | …1100111001001110101011 |
3 | 1022110011000101101012022010 |
4 | 2101230200130321032223 |
5 | 2303014301440243311 |
6 | 33143300141131003 |
7 | 2052231333062166 |
oct | 221544034711653 |
9 | 38404011335263 |
10 | 10012113212331 |
11 | 32101279907aa |
12 | 11584b8559a63 |
13 | 5781a48ab599 |
14 | 268835bbaadd |
15 | 1256885c7da6 |
hex | 91b207393ab |
10012113212331 has 16 divisors (see below), whose sum is σ = 13365931471488. Its totient is φ = 6666521328000.
The previous prime is 10012113212293. The next prime is 10012113212347. The reversal of 10012113212331 is 13321231121001.
It is not a de Polignac number, because 10012113212331 - 27 = 10012113212203 is a prime.
It is a super-3 number, since 3×100121132123313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10012113212298 and 10012113212307.
It is not an unprimeable number, because it can be changed into a prime (10012113210331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14182531 + ... + 14871731.
It is an arithmetic number, because the mean of its divisors is an integer number (835370716968).
Almost surely, 210012113212331 is an apocalyptic number.
10012113212331 is a deficient number, since it is larger than the sum of its proper divisors (3353818259157).
10012113212331 is an equidigital number, since it uses as much as digits as its factorization.
10012113212331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695162.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10012113212331 its reverse (13321231121001), we get a palindrome (23333344333332).
The spelling of 10012113212331 in words is "ten trillion, twelve billion, one hundred thirteen million, two hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •