Base | Representation |
---|---|
bin | 101111110000001101011111… |
… | …000001011010001011101011 |
3 | 1000112121211102112102111122211 |
4 | 233300031133001122023223 |
5 | 210011441404200341021 |
6 | 2022402223552225551 |
7 | 62144350060054243 |
oct | 5760153701321353 |
9 | 1015554375374584 |
10 | 210021200012011 |
11 | 60a12544190153 |
12 | 1b67b622b3b2b7 |
13 | 9025bb65bbabb |
14 | 39c111a56cb23 |
15 | 194320028c3e1 |
hex | bf035f05a2eb |
210021200012011 has 4 divisors (see below), whose sum is σ = 210021298308000. Its totient is φ = 210021101716024.
The previous prime is 210021200011999. The next prime is 210021200012021. The reversal of 210021200012011 is 110210002120012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210021200012011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210021200011982 and 210021200012000.
It is not an unprimeable number, because it can be changed into a prime (210021200012021) 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, 45870196 + ... + 50240593.
It is an arithmetic number, because the mean of its divisors is an integer number (52505324577000).
Almost surely, 2210021200012011 is an apocalyptic number.
210021200012011 is a deficient number, since it is larger than the sum of its proper divisors (98295989).
210021200012011 is an equidigital number, since it uses as much as digits as its factorization.
210021200012011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98295988.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210021200012011 its reverse (110210002120012), we get a palindrome (320231202132023).
The spelling of 210021200012011 in words is "two hundred ten trillion, twenty-one billion, two hundred million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •