Base | Representation |
---|---|
bin | 101101111101001111000001… |
… | …010110111100101110100001 |
3 | 222111122111022222122011010011 |
4 | 231331033001112330232201 |
5 | 202443013441130013212 |
6 | 1553512410252404521 |
7 | 60400460514063013 |
oct | 5575170126745641 |
9 | 874574288564104 |
10 | 202120110001057 |
11 | 59446725920716 |
12 | 1a804293a76741 |
13 | 88a1ac97432a1 |
14 | 37ca9462921b3 |
15 | 185791ba004a7 |
hex | b7d3c15bcba1 |
202120110001057 has 2 divisors, whose sum is σ = 202120110001058. Its totient is φ = 202120110001056.
The previous prime is 202120110000971. The next prime is 202120110001063. The reversal of 202120110001057 is 750100011021202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132301317977361 + 69818792023696 = 11502231^2 + 8355764^2 .
It is a cyclic number.
It is not a de Polignac number, because 202120110001057 - 27 = 202120110000929 is a prime.
It is a super-2 number, since 2×2021201100010572 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (202120110001157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101060055000528 + 101060055000529.
It is an arithmetic number, because the mean of its divisors is an integer number (101060055000529).
Almost surely, 2202120110001057 is an apocalyptic number.
It is an amenable number.
202120110001057 is a deficient number, since it is larger than the sum of its proper divisors (1).
202120110001057 is an equidigital number, since it uses as much as digits as its factorization.
202120110001057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 22.
Adding to 202120110001057 its reverse (750100011021202), we get a palindrome (952220121022259).
The spelling of 202120110001057 in words is "two hundred two trillion, one hundred twenty billion, one hundred ten million, one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •