Base | Representation |
---|---|
bin | 101110101010110110… |
… | …1011011011011110110 |
3 | 100120200122210021210220 |
4 | 1131111231123123312 |
5 | 3120223342020042 |
6 | 114012541555210 |
7 | 10145412546201 |
oct | 1352555333366 |
9 | 316618707726 |
10 | 100222220022 |
11 | 3955a915311 |
12 | 17510275b06 |
13 | 95b2876792 |
14 | 4bca788938 |
15 | 29189d28ec |
hex | 1755b5b6f6 |
100222220022 has 8 divisors (see below), whose sum is σ = 200444440056. Its totient is φ = 33407406672.
The previous prime is 100222219997. The next prime is 100222220027. The reversal of 100222220022 is 220022222001.
It is a sphenic number, since it is the product of 3 distinct primes.
100222220022 is an admirable number.
It is a super-2 number, since 2×1002222200222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100222219983 and 100222220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100222220027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8351851663 + ... + 8351851674.
It is an arithmetic number, because the mean of its divisors is an integer number (25055555007).
Almost surely, 2100222220022 is an apocalyptic number.
100222220022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222220022 is a wasteful number, since it uses less digits than its factorization.
100222220022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16703703342.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 100222220022 its reverse (220022222001), we get a palindrome (320244442023).
The spelling of 100222220022 in words is "one hundred billion, two hundred twenty-two million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •