Base | Representation |
---|---|
bin | 101111110000000011001010… |
… | …100110100001101010100011 |
3 | 1000112120202211100102200121111 |
4 | 233300003022212201222203 |
5 | 210011301211210032321 |
6 | 2022353152305204151 |
7 | 62143505356404544 |
oct | 5760031246415243 |
9 | 1015522740380544 |
10 | 210010120002211 |
11 | 60a08878874861 |
12 | 1b679450330657 |
13 | 9024b3bc2c799 |
14 | 39c0788bd24cb |
15 | 1942ca26965e1 |
hex | bf00ca9a1aa3 |
210010120002211 has 4 divisors (see below), whose sum is σ = 210264062107032. Its totient is φ = 209756177897392.
The previous prime is 210010120002191. The next prime is 210010120002251. The reversal of 210010120002211 is 112200021010012.
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 210010120002211 - 227 = 210009985784483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210010120002191 and 210010120002200.
It is not an unprimeable number, because it can be changed into a prime (210010120002251) 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, 126971051170 + ... + 126971052823.
It is an arithmetic number, because the mean of its divisors is an integer number (52566015526758).
Almost surely, 2210010120002211 is an apocalyptic number.
210010120002211 is a deficient number, since it is larger than the sum of its proper divisors (253942104821).
210010120002211 is an equidigital number, since it uses as much as digits as its factorization.
210010120002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253942104820.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210010120002211 its reverse (112200021010012), we get a palindrome (322210141012223).
The spelling of 210010120002211 in words is "two hundred ten trillion, ten billion, one hundred twenty million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •