Base | Representation |
---|---|
bin | 10110101111001101001101… |
… | …010110001101010100010000 |
3 | 111010002000010002220212220211 |
4 | 112233031031112031110100 |
5 | 101101404042413020422 |
6 | 552403500203013504 |
7 | 30030556346313325 |
oct | 2657151526152420 |
9 | 433060102825824 |
10 | 100001021220112 |
11 | 29955216503a41 |
12 | b270a4b80a294 |
13 | 43a50958a29bc |
14 | 1a9a10a6c4b4c |
15 | b863c9293577 |
hex | 5af34d58d510 |
100001021220112 has 10 divisors (see below), whose sum is σ = 193751978613998. Its totient is φ = 50000510610048.
The previous prime is 100001021220077. The next prime is 100001021220131. The reversal of 100001021220112 is 211022120100001.
It can be written as a sum of positive squares in only one way, i.e., 94436725236736 + 5564295983376 = 9717856^2 + 2358876^2 .
It is a junction number, because it is equal to n+sod(n) for n = 100001021220092 and 100001021220101.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 3125031913113 + ... + 3125031913144.
Almost surely, 2100001021220112 is an apocalyptic number.
It is an amenable number.
100001021220112 is a deficient number, since it is larger than the sum of its proper divisors (93750957393886).
100001021220112 is an equidigital number, since it uses as much as digits as its factorization.
100001021220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6250063826265 (or 6250063826259 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100001021220112 its reverse (211022120100001), we get a palindrome (311023141320113).
The spelling of 100001021220112 in words is "one hundred trillion, one billion, twenty-one million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •