Base | Representation |
---|---|
bin | 101101101101001111011010… |
… | …100000001010101011111101 |
3 | 222100202102101112022022020221 |
4 | 231231033122200022223331 |
5 | 202322012022134021112 |
6 | 1551311440512141341 |
7 | 60225201164065324 |
oct | 5555173240125375 |
9 | 870672345268227 |
10 | 201021020220157 |
11 | 59062599341815 |
12 | 1a667278b37851 |
13 | 882227c3cbbc7 |
14 | 378d67da450bb |
15 | 1839040de8e07 |
hex | b6d3da80aafd |
201021020220157 has 2 divisors, whose sum is σ = 201021020220158. Its totient is φ = 201021020220156.
The previous prime is 201021020220127. The next prime is 201021020220203. The reversal of 201021020220157 is 751022020120102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116558560620441 + 84462459599716 = 10796229^2 + 9190346^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201021020220157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201021020220127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100510510110078 + 100510510110079.
It is an arithmetic number, because the mean of its divisors is an integer number (100510510110079).
Almost surely, 2201021020220157 is an apocalyptic number.
It is an amenable number.
201021020220157 is a deficient number, since it is larger than the sum of its proper divisors (1).
201021020220157 is an equidigital number, since it uses as much as digits as its factorization.
201021020220157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 201021020220157 its reverse (751022020120102), we get a palindrome (952043040340259).
The spelling of 201021020220157 in words is "two hundred one trillion, twenty-one billion, twenty million, two hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •