Base | Representation |
---|---|
bin | 1001001001010011101010… |
… | …00101010101010100111101 |
3 | 2122012121000020211022222221 |
4 | 10210221311011111110331 |
5 | 10113444312302242341 |
6 | 110434511051205341 |
7 | 4143654233532253 |
oct | 444516505252475 |
9 | 78177006738887 |
10 | 20111001212221 |
11 | 6454033989767 |
12 | 2309791746851 |
13 | b2b5c80537ba |
14 | 4d75403c65d3 |
15 | 24d1eeceded1 |
hex | 124a7515553d |
20111001212221 has 2 divisors, whose sum is σ = 20111001212222. Its totient is φ = 20111001212220.
The previous prime is 20111001212189. The next prime is 20111001212299. The reversal of 20111001212221 is 12221210011102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14458162107321 + 5652839104900 = 3802389^2 + 2377570^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111001212221 - 25 = 20111001212189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20111001212195 and 20111001212204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111001212921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055500606110 + 10055500606111.
It is an arithmetic number, because the mean of its divisors is an integer number (10055500606111).
Almost surely, 220111001212221 is an apocalyptic number.
It is an amenable number.
20111001212221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111001212221 is an equidigital number, since it uses as much as digits as its factorization.
20111001212221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20111001212221 its reverse (12221210011102), we get a palindrome (32332211223323).
The spelling of 20111001212221 in words is "twenty trillion, one hundred eleven billion, one million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •