Base | Representation |
---|---|
bin | 10001011111011110110… |
… | …000110110000110101001 |
3 | 11020220122202120111022002 |
4 | 101133132300312012221 |
5 | 124143231001101212 |
6 | 2320112331340345 |
7 | 152562334543103 |
oct | 21373660660651 |
9 | 4226582514262 |
10 | 1202033222057 |
11 | 4238634649a8 |
12 | 174b665b16b5 |
13 | 894748c4795 |
14 | 42270590573 |
15 | 21403461ac2 |
hex | 117dec361a9 |
1202033222057 has 2 divisors, whose sum is σ = 1202033222058. Its totient is φ = 1202033222056.
The previous prime is 1202033221967. The next prime is 1202033222059. The reversal of 1202033222057 is 7502223302021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 997393700416 + 204639521641 = 998696^2 + 452371^2 .
It is a cyclic number.
It is not a de Polignac number, because 1202033222057 - 232 = 1197738254761 is a prime.
It is a super-2 number, since 2×12020332220572 (a number of 25 digits) contains 22 as substring.
Together with 1202033222059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1202033222059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601016611028 + 601016611029.
It is an arithmetic number, because the mean of its divisors is an integer number (601016611029).
Almost surely, 21202033222057 is an apocalyptic number.
It is an amenable number.
1202033222057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202033222057 is an equidigital number, since it uses as much as digits as its factorization.
1202033222057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 29.
Adding to 1202033222057 its reverse (7502223302021), we get a palindrome (8704256524078).
The spelling of 1202033222057 in words is "one trillion, two hundred two billion, thirty-three million, two hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •