Base | Representation |
---|---|
bin | 10110110010011001010101… |
… | …011010111010000111011011 |
3 | 111010211221212001110122012202 |
4 | 112302121111122322013123 |
5 | 101114001432200031021 |
6 | 553052305125000415 |
7 | 30052445661236345 |
oct | 2662312532720733 |
9 | 433757761418182 |
10 | 100220200002011 |
11 | 29a2a16a190911 |
12 | b2a741a25310b |
13 | 43bc9553c7c1b |
14 | 1aa697d99c295 |
15 | b8be56319a0b |
hex | 5b26556ba1db |
100220200002011 has 4 divisors (see below), whose sum is σ = 100546650165192. Its totient is φ = 99893749838832.
The previous prime is 100220200001989. The next prime is 100220200002017. The reversal of 100220200002011 is 110200002022001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100220200002011 - 222 = 100220195807707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100220200001983 and 100220200002001.
It is not an unprimeable number, because it can be changed into a prime (100220200002017) 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, 163225081130 + ... + 163225081743.
It is an arithmetic number, because the mean of its divisors is an integer number (25136662541298).
Almost surely, 2100220200002011 is an apocalyptic number.
100220200002011 is a deficient number, since it is larger than the sum of its proper divisors (326450163181).
100220200002011 is an equidigital number, since it uses as much as digits as its factorization.
100220200002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326450163180.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 100220200002011 its reverse (110200002022001), we get a palindrome (210420202024012).
The spelling of 100220200002011 in words is "one hundred trillion, two hundred twenty billion, two hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •