Base | Representation |
---|---|
bin | 1011110000111101001… |
… | …0101001100111110111 |
3 | 201022201002110100210212 |
4 | 2330033102221213313 |
5 | 11302420210311411 |
6 | 232504101140035 |
7 | 20413502511566 |
oct | 2741722514767 |
9 | 638632410725 |
10 | 202120010231 |
11 | 7879a527277 |
12 | 332096ba61b |
13 | 160a15c4cb9 |
14 | 9ad5899bdd |
15 | 53ce64068b |
hex | 2f0f4a99f7 |
202120010231 has 2 divisors, whose sum is σ = 202120010232. Its totient is φ = 202120010230.
The previous prime is 202120010221. The next prime is 202120010233. The reversal of 202120010231 is 132010021202.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202120010231 - 226 = 202052901367 is a prime.
It is a super-2 number, since 2×2021200102312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 202120010233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202120010233) 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, 101060005115 + 101060005116.
It is an arithmetic number, because the mean of its divisors is an integer number (101060005116).
Almost surely, 2202120010231 is an apocalyptic number.
202120010231 is a deficient number, since it is larger than the sum of its proper divisors (1).
202120010231 is an equidigital number, since it uses as much as digits as its factorization.
202120010231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 202120010231 its reverse (132010021202), we get a palindrome (334130031433).
The spelling of 202120010231 in words is "two hundred two billion, one hundred twenty million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •