Base | Representation |
---|---|
bin | 10001011111100011111… |
… | …011111101011111111101 |
3 | 11020220212210220101110021 |
4 | 101133203323331133331 |
5 | 124143420211201023 |
6 | 2320125112012141 |
7 | 152564440410151 |
oct | 21374373753775 |
9 | 4226783811407 |
10 | 1202120022013 |
11 | 4238a845aaa9 |
12 | 174b8b691051 |
13 | 89489895cc1 |
14 | 4227bd07061 |
15 | 2140adaa35d |
hex | 117e3efd7fd |
1202120022013 has 2 divisors, whose sum is σ = 1202120022014. Its totient is φ = 1202120022012.
The previous prime is 1202120021987. The next prime is 1202120022029. The reversal of 1202120022013 is 3102200212021.
It is a happy number.
It is an a-pointer prime, because the next prime (1202120022029) can be obtained adding 1202120022013 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1014667392249 + 187452629764 = 1007307^2 + 432958^2 .
It is a cyclic number.
It is not a de Polignac number, because 1202120022013 - 237 = 1064681068541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1202120022053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601060011006 + 601060011007.
It is an arithmetic number, because the mean of its divisors is an integer number (601060011007).
Almost surely, 21202120022013 is an apocalyptic number.
It is an amenable number.
1202120022013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202120022013 is an equidigital number, since it uses as much as digits as its factorization.
1202120022013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1202120022013 its reverse (3102200212021), we get a palindrome (4304320234034).
The spelling of 1202120022013 in words is "one trillion, two hundred two billion, one hundred twenty million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •