Base | Representation |
---|---|
bin | 1001001001010101111010… |
… | …10000001100111111100101 |
3 | 2122012201010122011210200201 |
4 | 10210222331100030333211 |
5 | 10114004302234134341 |
6 | 110435231143110501 |
7 | 4144026235326535 |
oct | 444527520147745 |
9 | 78181118153621 |
10 | 20112212021221 |
11 | 64545a53a8461 |
12 | 2309a6b142431 |
13 | b2b75bb60b28 |
14 | 4d761712b4c5 |
15 | 24d271272331 |
hex | 124abd40cfe5 |
20112212021221 has 2 divisors, whose sum is σ = 20112212021222. Its totient is φ = 20112212021220.
The previous prime is 20112212021207. The next prime is 20112212021261. The reversal of 20112212021221 is 12212021221102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18917158576996 + 1195053444225 = 4349386^2 + 1093185^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112212021221 - 213 = 20112212013029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112212021261) 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, 10056106010610 + 10056106010611.
It is an arithmetic number, because the mean of its divisors is an integer number (10056106010611).
Almost surely, 220112212021221 is an apocalyptic number.
It is an amenable number.
20112212021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112212021221 is an equidigital number, since it uses as much as digits as its factorization.
20112212021221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 20112212021221 its reverse (12212021221102), we get a palindrome (32324233242323).
The spelling of 20112212021221 in words is "twenty trillion, one hundred twelve billion, two hundred twelve million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •