Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …101000100110100010000110 |
3 | 111021022122102201021010202212 |
4 | 113000222002220212202012 |
5 | 101231031013021010042 |
6 | 555122422444103422 |
7 | 30213321400224353 |
oct | 2700520250464206 |
9 | 437278381233685 |
10 | 101200211110022 |
11 | 2a27784a984362 |
12 | b425341b34b72 |
13 | 44611a63a7b0b |
14 | 1adc18b3b162a |
15 | ba76b2cab482 |
hex | 5c0a82a26886 |
101200211110022 has 8 divisors (see below), whose sum is σ = 152519749446072. Its totient is φ = 50360294628000.
The previous prime is 101200211109979. The next prime is 101200211110067. The reversal of 101200211110022 is 220011112002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101200211109979 and 101200211110006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119905462979 + ... + 119905463822.
It is an arithmetic number, because the mean of its divisors is an integer number (19064968680759).
Almost surely, 2101200211110022 is an apocalyptic number.
101200211110022 is a deficient number, since it is larger than the sum of its proper divisors (51319538336050).
101200211110022 is a wasteful number, since it uses less digits than its factorization.
101200211110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239810927014.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101200211110022 its reverse (220011112002101), we get a palindrome (321211323112123).
The spelling of 101200211110022 in words is "one hundred one trillion, two hundred billion, two hundred eleven million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •