Base | Representation |
---|---|
bin | 1001001001010001111110… |
… | …11011011000001000100101 |
3 | 2122012111200111221220002112 |
4 | 10210220333123120020211 |
5 | 10113440441330134341 |
6 | 110434241453050405 |
7 | 4143623023166561 |
oct | 444507733301045 |
9 | 78174614856075 |
10 | 20110101021221 |
11 | 6453711836962 |
12 | 2309580186a05 |
13 | b2b4b36c11c3 |
14 | 4d7496a1a6a1 |
15 | 24d19ac85aeb |
hex | 124a3f6d8225 |
20110101021221 has 2 divisors, whose sum is σ = 20110101021222. Its totient is φ = 20110101021220.
The previous prime is 20110101021193. The next prime is 20110101021247. The reversal of 20110101021221 is 12212010101102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13492030922500 + 6618070098721 = 3673150^2 + 2572561^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110101021221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110101021196 and 20110101021205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110101021421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055050510610 + 10055050510611.
It is an arithmetic number, because the mean of its divisors is an integer number (10055050510611).
Almost surely, 220110101021221 is an apocalyptic number.
It is an amenable number.
20110101021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110101021221 is an equidigital number, since it uses as much as digits as its factorization.
20110101021221 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 14.
Adding to 20110101021221 its reverse (12212010101102), we get a palindrome (32322111122323).
The spelling of 20110101021221 in words is "twenty trillion, one hundred ten billion, one hundred one million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •