Base | Representation |
---|---|
bin | 10011101111110000… |
… | …011011101110110111 |
3 | 2000201121220110122122 |
4 | 103233300123232313 |
5 | 321410243222221 |
6 | 13423515150155 |
7 | 1350261514634 |
oct | 235760335667 |
9 | 60647813578 |
10 | 21202320311 |
11 | 8aa0180077 |
12 | 413874535b |
13 | 1ccb802283 |
14 | 1051c5b18b |
15 | 8415b3eab |
hex | 4efc1bbb7 |
21202320311 has 2 divisors, whose sum is σ = 21202320312. Its totient is φ = 21202320310.
The previous prime is 21202320301. The next prime is 21202320313. The reversal of 21202320311 is 11302320212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21202320311 - 230 = 20128578487 is a prime.
Together with 21202320313, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21202320311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21202320313) 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, 10601160155 + 10601160156.
It is an arithmetic number, because the mean of its divisors is an integer number (10601160156).
Almost surely, 221202320311 is an apocalyptic number.
21202320311 is a deficient number, since it is larger than the sum of its proper divisors (1).
21202320311 is an equidigital number, since it uses as much as digits as its factorization.
21202320311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 21202320311 its reverse (11302320212), we get a palindrome (32504640523).
Subtracting from 21202320311 its reverse (11302320212), we obtain a palindrome (9900000099).
The spelling of 21202320311 in words is "twenty-one billion, two hundred two million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •