Base | Representation |
---|---|
bin | 101101111011110001111000… |
… | …111001001101111101010101 |
3 | 222111021221012210222202100201 |
4 | 231323301320321031331111 |
5 | 202434344141124444312 |
6 | 1553354431325340501 |
7 | 60360320440101214 |
oct | 5573617071157525 |
9 | 874257183882321 |
10 | 202020109999957 |
11 | 5940827a494807 |
12 | 1a7a8a26107731 |
13 | 8895550c331c2 |
14 | 37c5b7b23107b |
15 | 18550177b5557 |
hex | b7bc78e4df55 |
202020109999957 has 2 divisors, whose sum is σ = 202020109999958. Its totient is φ = 202020109999956.
The previous prime is 202020109999913. The next prime is 202020110000021. The reversal of 202020109999957 is 759999901020202.
It is an a-pointer prime, because the next prime (202020110000021) can be obtained adding 202020109999957 to its sum of digits (64).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106876745810641 + 95143364189316 = 10338121^2 + 9754146^2 .
It is a cyclic number.
It is not a de Polignac number, because 202020109999957 - 243 = 193224016977749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202020109909957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101010054999978 + 101010054999979.
It is an arithmetic number, because the mean of its divisors is an integer number (101010054999979).
Almost surely, 2202020109999957 is an apocalyptic number.
It is an amenable number.
202020109999957 is a deficient number, since it is larger than the sum of its proper divisors (1).
202020109999957 is an equidigital number, since it uses as much as digits as its factorization.
202020109999957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16533720, while the sum is 64.
The spelling of 202020109999957 in words is "two hundred two trillion, twenty billion, one hundred nine million, nine hundred ninety-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •