Base | Representation |
---|---|
bin | 10110110000110100110001… |
… | …011000100010110010100010 |
3 | 111010110122010211100011200021 |
4 | 112300310301120202302202 |
5 | 101110214312113020002 |
6 | 552530530340544054 |
7 | 30041604111601615 |
oct | 2660646130426242 |
9 | 433418124304607 |
10 | 100112221220002 |
11 | 29998399a5a7a2 |
12 | b28a5043b202a |
13 | 43b2707893cc4 |
14 | 1aa1658dd817c |
15 | b892368c6737 |
hex | 5b0d31622ca2 |
100112221220002 has 8 divisors (see below), whose sum is σ = 151497255120876. Its totient is φ = 49613136179712.
The previous prime is 100112221219981. The next prime is 100112221220023. The reversal of 100112221220002 is 200022122211001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (100112221219981) and next prime (100112221220023).
It can be written as a sum of positive squares in 2 ways, for example, as 85297581877561 + 14814639342441 = 9235669^2 + 3848979^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221487214863 + ... + 221487215314.
Almost surely, 2100112221220002 is an apocalyptic number.
100112221220002 is a deficient number, since it is larger than the sum of its proper divisors (51385033900874).
100112221220002 is a wasteful number, since it uses less digits than its factorization.
100112221220002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 442974430292.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100112221220002 its reverse (200022122211001), we get a palindrome (300134343431003).
Subtracting 100112221220002 from its reverse (200022122211001), we obtain a palindrome (99909900990999).
The spelling of 100112221220002 in words is "one hundred trillion, one hundred twelve billion, two hundred twenty-one million, two hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •