Base | Representation |
---|---|
bin | 11101101111111111111… |
… | …11111100000010100111 |
3 | 10121201111000210001112022 |
4 | 32313333333330002213 |
5 | 113221432230401411 |
6 | 2101332044413355 |
7 | 133565060224532 |
oct | 16677777740247 |
9 | 3551430701468 |
10 | 1022202200231 |
11 | 364571547603 |
12 | 14613954725b |
13 | 75515c95424 |
14 | 37690dbda19 |
15 | 1b8ca9d5edb |
hex | edffffc0a7 |
1022202200231 has 2 divisors, whose sum is σ = 1022202200232. Its totient is φ = 1022202200230.
The previous prime is 1022202200209. The next prime is 1022202200263. The reversal of 1022202200231 is 1320022022201.
It is a weak prime.
It is an emirp because it is prime and its reverse (1320022022201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022202200231 - 230 = 1021128458407 is a prime.
It is a super-2 number, since 2×10222022002312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022202200731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511101100115 + 511101100116.
It is an arithmetic number, because the mean of its divisors is an integer number (511101100116).
Almost surely, 21022202200231 is an apocalyptic number.
1022202200231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022202200231 is an equidigital number, since it uses as much as digits as its factorization.
1022202200231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 1022202200231 its reverse (1320022022201), we get a palindrome (2342224222432).
The spelling of 1022202200231 in words is "one trillion, twenty-two billion, two hundred two million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •