Base | Representation |
---|---|
bin | 101110100100110101… |
… | …0011100011101110110 |
3 | 100120011120111002122210 |
4 | 1131021222130131312 |
5 | 3114320122024342 |
6 | 113540522034250 |
7 | 10140406626543 |
oct | 1351152343566 |
9 | 316146432583 |
10 | 100020111222 |
11 | 39466821a49 |
12 | 17474648986 |
13 | 957ca31685 |
14 | 4bab9b7bca |
15 | 2905dad79c |
hex | 1749a9c776 |
100020111222 has 8 divisors (see below), whose sum is σ = 200040222456. Its totient is φ = 33340037072.
The previous prime is 100020111211. The next prime is 100020111229. The reversal of 100020111222 is 222111020001.
It is a sphenic number, since it is the product of 3 distinct primes.
100020111222 is an admirable number.
It is a super-2 number, since 2×1000201112222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100020111198 and 100020111207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100020111229) 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, 8335009263 + ... + 8335009274.
It is an arithmetic number, because the mean of its divisors is an integer number (25005027807).
Almost surely, 2100020111222 is an apocalyptic number.
100020111222 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.
100020111222 is a wasteful number, since it uses less digits than its factorization.
100020111222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16670018542.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100020111222 its reverse (222111020001), we get a palindrome (322131131223).
The spelling of 100020111222 in words is "one hundred billion, twenty million, one hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •