Base | Representation |
---|---|
bin | 10001011111101000110… |
… | …001101000100110100001 |
3 | 11020221002110122201011112 |
4 | 101133220301220212201 |
5 | 124144102001413212 |
6 | 2320141131553105 |
7 | 152566444413563 |
oct | 21375061504641 |
9 | 4227073581145 |
10 | 1202201201057 |
11 | 42393a26701a |
12 | 174bb28bb795 |
13 | 894a0649c3c |
14 | 422889d9333 |
15 | 21413093422 |
hex | 117e8c689a1 |
1202201201057 has 2 divisors, whose sum is σ = 1202201201058. Its totient is φ = 1202201201056.
The previous prime is 1202201201027. The next prime is 1202201201059. The reversal of 1202201201057 is 7501021022021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 640422469696 + 561778731361 = 800264^2 + 749519^2 .
It is a cyclic number.
It is not a de Polignac number, because 1202201201057 - 240 = 102689573281 is a prime.
Together with 1202201201059, 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 (1202201201059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601100600528 + 601100600529.
It is an arithmetic number, because the mean of its divisors is an integer number (601100600529).
Almost surely, 21202201201057 is an apocalyptic number.
It is an amenable number.
1202201201057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202201201057 is an equidigital number, since it uses as much as digits as its factorization.
1202201201057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 1202201201057 its reverse (7501021022021), we get a palindrome (8703222223078).
The spelling of 1202201201057 in words is "one trillion, two hundred two billion, two hundred one million, two hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •