Base | Representation |
---|---|
bin | 10111001111010110011111… |
… | …111011110100010110111011 |
3 | 111101220011221000211212101011 |
4 | 113033112133323310112323 |
5 | 101344102110110014321 |
6 | 1001214345053134351 |
7 | 30346300402201663 |
oct | 2717263773642673 |
9 | 441804830755334 |
10 | 102210020001211 |
11 | 2a6270317543a1 |
12 | b568ba0a8a3b7 |
13 | 450549589a785 |
14 | 1b34dc44311a3 |
15 | bc3ab5730ae1 |
hex | 5cf59fef45bb |
102210020001211 has 4 divisors (see below), whose sum is σ = 102210040341424. Its totient is φ = 102209999661000.
The previous prime is 102210020001203. The next prime is 102210020001301. The reversal of 102210020001211 is 112100020012201.
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 102210020001211 - 23 = 102210020001203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102210020001191 and 102210020001200.
It is not an unprimeable number, because it can be changed into a prime (102210020401211) 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, 3427546 + ... + 14702656.
It is an arithmetic number, because the mean of its divisors is an integer number (25552510085356).
Almost surely, 2102210020001211 is an apocalyptic number.
102210020001211 is a deficient number, since it is larger than the sum of its proper divisors (20340213).
102210020001211 is an equidigital number, since it uses as much as digits as its factorization.
102210020001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20340212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102210020001211 its reverse (112100020012201), we get a palindrome (214310040013412).
The spelling of 102210020001211 in words is "one hundred two trillion, two hundred ten billion, twenty million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •