Base | Representation |
---|---|
bin | 10011101010111111… |
… | …001100000101011101 |
3 | 2000112001100010120122 |
4 | 103222333030011131 |
5 | 321224302133201 |
6 | 13411540124325 |
7 | 1345300415162 |
oct | 235277140535 |
9 | 60461303518 |
10 | 21122302301 |
11 | 8a59a97391 |
12 | 41159966a5 |
13 | 1cb8066939 |
14 | 104538c069 |
15 | 839559e1b |
hex | 4eafcc15d |
21122302301 has 2 divisors, whose sum is σ = 21122302302. Its totient is φ = 21122302300.
The previous prime is 21122302297. The next prime is 21122302303. The reversal of 21122302301 is 10320322112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19944783076 + 1177519225 = 141226^2 + 34315^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122302301 - 22 = 21122302297 is a prime.
It is a Sophie Germain prime.
Together with 21122302303, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 21122302301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21122302303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561151150 + 10561151151.
It is an arithmetic number, because the mean of its divisors is an integer number (10561151151).
Almost surely, 221122302301 is an apocalyptic number.
It is an amenable number.
21122302301 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122302301 is an equidigital number, since it uses as much as digits as its factorization.
21122302301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 21122302301 its reverse (10320322112), we get a palindrome (31442624413).
The spelling of 21122302301 in words is "twenty-one billion, one hundred twenty-two million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •