Base | Representation |
---|---|
bin | 10110110010010000110001… |
… | …000100100001100101110011 |
3 | 111010211002002220110021211101 |
4 | 112302100301010201211303 |
5 | 101113324112024020034 |
6 | 553044144205425231 |
7 | 30052002001336453 |
oct | 2662206104414563 |
9 | 433732086407741 |
10 | 100211000220019 |
11 | 29a262791464a7 |
12 | b2a569126b217 |
13 | 43bbb1a438940 |
14 | 1aa6349c1dd63 |
15 | b8bab8828514 |
hex | 5b2431121973 |
100211000220019 has 8 divisors (see below), whose sum is σ = 107946880922160. Its totient is φ = 92479025549856.
The previous prime is 100211000220011. The next prime is 100211000220029. The reversal of 100211000220019 is 910022000112001.
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 100211000220019 - 23 = 100211000220011 is a prime.
It is a super-2 number, since 2×1002110002200192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100211000219978 and 100211000220005.
It is not an unprimeable number, because it can be changed into a prime (100211000220011) 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, 976454704 + ... + 976557325.
It is an arithmetic number, because the mean of its divisors is an integer number (13493360115270).
Almost surely, 2100211000220019 is an apocalyptic number.
100211000220019 is a deficient number, since it is larger than the sum of its proper divisors (7735880702141).
100211000220019 is a wasteful number, since it uses less digits than its factorization.
100211000220019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1953015989.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 100211000220019 in words is "one hundred trillion, two hundred eleven billion, two hundred twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •