Base | Representation |
---|---|
bin | 101111001000000000… |
… | …0001101011110011110 |
3 | 100200012211001221110110 |
4 | 1132100000031132132 |
5 | 3124224224101420 |
6 | 114253555550450 |
7 | 10211556460221 |
oct | 1362000153636 |
9 | 320184057413 |
10 | 101200222110 |
11 | 39a119837a9 |
12 | 177438bb426 |
13 | 970a381040 |
14 | 4c8060b5b8 |
15 | 29747baee0 |
hex | 179000d79e |
101200222110 has 64 divisors (see below), whose sum is σ = 261617287680. Its totient is φ = 24905715840.
The previous prime is 101200222093. The next prime is 101200222117. The reversal of 101200222110 is 11222002101.
It is a super-2 number, since 2×1012002221102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200222117) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2094201 + ... + 2141979.
It is an arithmetic number, because the mean of its divisors is an integer number (4087770120).
Almost surely, 2101200222110 is an apocalyptic number.
101200222110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101200222110 is an abundant number, since it is smaller than the sum of its proper divisors (160417065570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200222110 is a wasteful number, since it uses less digits than its factorization.
101200222110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53233.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101200222110 its reverse (11222002101), we get a palindrome (112422224211).
The spelling of 101200222110 in words is "one hundred one billion, two hundred million, two hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •