Base | Representation |
---|---|
bin | 10111001101110000001111… |
… | …011110000100001010010000 |
3 | 111101111200112000201120120120 |
4 | 113031300033132010022100 |
5 | 101340302223324200422 |
6 | 1001052110003110240 |
7 | 30335332453350105 |
oct | 2715601736041220 |
9 | 441450460646516 |
10 | 102100222100112 |
11 | 2a5945086a0175 |
12 | b54b859972380 |
13 | 44c8018211322 |
14 | 1b2d96a018aac |
15 | bc0cdb25945c |
hex | 5cdc0f784290 |
102100222100112 has 40 divisors (see below), whose sum is σ = 263770106638656. Its totient is φ = 34031962263936.
The previous prime is 102100222100111. The next prime is 102100222100137. The reversal of 102100222100112 is 211001222001201.
It is a junction number, because it is equal to n+sod(n) for n = 102100222100091 and 102100222100100.
It is not an unprimeable number, because it can be changed into a prime (102100222100111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44016948 + ... + 46278419.
Almost surely, 2102100222100112 is an apocalyptic number.
102100222100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102100222100112 is an abundant number, since it is smaller than the sum of its proper divisors (161669884538544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100222100112 is a wasteful number, since it uses less digits than its factorization.
102100222100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90318935 (or 90318929 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102100222100112 its reverse (211001222001201), we get a palindrome (313101444101313).
The spelling of 102100222100112 in words is "one hundred two trillion, one hundred billion, two hundred twenty-two million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •