Base | Representation |
---|---|
bin | 101101111110011011011111… |
… | …101000001010111111000101 |
3 | 222111221100021112020121110111 |
4 | 231332123133220022333011 |
5 | 203000340122341223023 |
6 | 1554014230222153021 |
7 | 60406425364254103 |
oct | 5576333750127705 |
9 | 874840245217414 |
10 | 202202222211013 |
11 | 59478532045362 |
12 | 1a81818b122771 |
13 | 88a978434c67b |
14 | 37d08d5774c73 |
15 | 1859b2564900d |
hex | b7e6dfa0afc5 |
202202222211013 has 2 divisors, whose sum is σ = 202202222211014. Its totient is φ = 202202222211012.
The previous prime is 202202222210983. The next prime is 202202222211083. The reversal of 202202222211013 is 310112222202202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 170418978109444 + 31783244101569 = 13054462^2 + 5637663^2 .
It is a cyclic number.
It is not a de Polignac number, because 202202222211013 - 213 = 202202222202821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202202222211083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101101111105506 + 101101111105507.
It is an arithmetic number, because the mean of its divisors is an integer number (101101111105507).
Almost surely, 2202202222211013 is an apocalyptic number.
It is an amenable number.
202202222211013 is a deficient number, since it is larger than the sum of its proper divisors (1).
202202222211013 is an equidigital number, since it uses as much as digits as its factorization.
202202222211013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 202202222211013 its reverse (310112222202202), we get a palindrome (512314444413215).
The spelling of 202202222211013 in words is "two hundred two trillion, two hundred two billion, two hundred twenty-two million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •