Base | Representation |
---|---|
bin | 10110101111001110010100… |
… | …110011010001100101010101 |
3 | 111010002010012122200100002111 |
4 | 112233032110303101211111 |
5 | 101101414021311201401 |
6 | 552404215145311021 |
7 | 30030631144052005 |
oct | 2657162463214525 |
9 | 433063178610074 |
10 | 100002220022101 |
11 | 29955781171691 |
12 | b271125195471 |
13 | 43a5227067aa7 |
14 | 1a9a1c19c2005 |
15 | b86449643e51 |
hex | 5af394cd1955 |
100002220022101 has 8 divisors (see below), whose sum is σ = 100282309459200. Its totient is φ = 99722139095280.
The previous prime is 100002220022093. The next prime is 100002220022147. The reversal of 100002220022101 is 101220022200001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100002220022101 - 23 = 100002220022093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002220022401) 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, 21782596 + ... + 25970866.
It is an arithmetic number, because the mean of its divisors is an integer number (12535288682400).
Almost surely, 2100002220022101 is an apocalyptic number.
It is an amenable number.
100002220022101 is a deficient number, since it is larger than the sum of its proper divisors (280089437099).
100002220022101 is an equidigital number, since it uses as much as digits as its factorization.
100002220022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4255139.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100002220022101 its reverse (101220022200001), we get a palindrome (201222242222102).
The spelling of 100002220022101 in words is "one hundred trillion, two billion, two hundred twenty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •