Base | Representation |
---|---|
bin | 1001001001000010111011… |
… | …10100111011001010110011 |
3 | 2122011201211102011101011211 |
4 | 10210201131310323022303 |
5 | 10113322414400201321 |
6 | 110430424020220551 |
7 | 4143215552042551 |
oct | 444413564731263 |
9 | 78151742141154 |
10 | 20102021100211 |
11 | 6450245941696 |
12 | 2307aa623a757 |
13 | b2a7c674795b |
14 | 4d6d2b8aabd1 |
15 | 24cd767500e1 |
hex | 12485dd3b2b3 |
20102021100211 has 2 divisors, whose sum is σ = 20102021100212. Its totient is φ = 20102021100210.
The previous prime is 20102021100209. The next prime is 20102021100233. The reversal of 20102021100211 is 11200112020102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20102021100211 - 21 = 20102021100209 is a prime.
Together with 20102021100209, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20102021100191 and 20102021100200.
It is not a weakly prime, because it can be changed into another prime (20102021100011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051010550105 + 10051010550106.
It is an arithmetic number, because the mean of its divisors is an integer number (10051010550106).
Almost surely, 220102021100211 is an apocalyptic number.
20102021100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102021100211 is an equidigital number, since it uses as much as digits as its factorization.
20102021100211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20102021100211 its reverse (11200112020102), we get a palindrome (31302133120313).
The spelling of 20102021100211 in words is "twenty trillion, one hundred two billion, twenty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •