Base | Representation |
---|---|
bin | 101101111101001111110111… |
… | …101001100110001001001101 |
3 | 222111122120200110120112020221 |
4 | 231331033313221212021031 |
5 | 202443022322314441312 |
6 | 1553513040511311341 |
7 | 60400522214203264 |
oct | 5575176751461115 |
9 | 874576613515227 |
10 | 202121020858957 |
11 | 59447052a99742 |
12 | 1a8044a8b1b551 |
13 | 88a1c1336bb65 |
14 | 37ca9d12375db |
15 | 1857971974207 |
hex | b7d3f7a6624d |
202121020858957 has 2 divisors, whose sum is σ = 202121020858958. Its totient is φ = 202121020858956.
The previous prime is 202121020858793. The next prime is 202121020858979. The reversal of 202121020858957 is 759858020121202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 187568062411401 + 14552958447556 = 13695549^2 + 3814834^2 .
It is a cyclic number.
It is not a de Polignac number, because 202121020858957 - 239 = 201571265045069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202121020858457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101060510429478 + 101060510429479.
It is an arithmetic number, because the mean of its divisors is an integer number (101060510429479).
Almost surely, 2202121020858957 is an apocalyptic number.
It is an amenable number.
202121020858957 is a deficient number, since it is larger than the sum of its proper divisors (1).
202121020858957 is an equidigital number, since it uses as much as digits as its factorization.
202121020858957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1612800, while the sum is 52.
The spelling of 202121020858957 in words is "two hundred two trillion, one hundred twenty-one billion, twenty million, eight hundred fifty-eight thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •