Base | Representation |
---|---|
bin | 11001011110010001000101… |
… | …111011101000101101011100 |
3 | 112200200001211222220222212020 |
4 | 121132101011323220231130 |
5 | 104141004143123210022 |
6 | 1034134213230140140 |
7 | 32411660046453054 |
oct | 3136210573505534 |
9 | 480601758828766 |
10 | 112031100210012 |
11 | 32773139473085 |
12 | 10694464951650 |
13 | 4a68644b23059 |
14 | 1d94496dd0564 |
15 | ce42bcbe235c |
hex | 65e445ee8b5c |
112031100210012 has 48 divisors (see below), whose sum is σ = 276801139867392. Its totient is φ = 35144672567040.
The previous prime is 112031100209983. The next prime is 112031100210031. The reversal of 112031100210012 is 210012001130211.
It is a junction number, because it is equal to n+sod(n) for n = 112031100209973 and 112031100210000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15201658 + ... + 21334305.
It is an arithmetic number, because the mean of its divisors is an integer number (5766690413904).
Almost surely, 2112031100210012 is an apocalyptic number.
112031100210012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112031100210012 is an abundant number, since it is smaller than the sum of its proper divisors (164770039657380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112031100210012 is a wasteful number, since it uses less digits than its factorization.
112031100210012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36551018 (or 36551016 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 112031100210012 its reverse (210012001130211), we get a palindrome (322043101340223).
The spelling of 112031100210012 in words is "one hundred twelve trillion, thirty-one billion, one hundred million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •