Base | Representation |
---|---|
bin | 100010101100000110011001… |
… | …101001011100110101000101 |
3 | 202000011222122012212202002202 |
4 | 202230012121221130311011 |
5 | 124444102244420220003 |
6 | 1300250552435444245 |
7 | 44064251616411545 |
oct | 4254063151346505 |
9 | 660158565782082 |
10 | 152564111101253 |
11 | 44680092418845 |
12 | 1513bb44156685 |
13 | 6718970629307 |
14 | 29961dc977325 |
15 | 1298821662088 |
hex | 8ac199a5cd45 |
152564111101253 has 2 divisors, whose sum is σ = 152564111101254. Its totient is φ = 152564111101252.
The previous prime is 152564111101229. The next prime is 152564111101307. The reversal of 152564111101253 is 352101111465251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 149024960626084 + 3539150475169 = 12207578^2 + 1881263^2 .
It is a cyclic number.
It is not a de Polignac number, because 152564111101253 - 26 = 152564111101189 is a prime.
It is a super-2 number, since 2×1525641111012532 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152564111101223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76282055550626 + 76282055550627.
It is an arithmetic number, because the mean of its divisors is an integer number (76282055550627).
Almost surely, 2152564111101253 is an apocalyptic number.
It is an amenable number.
152564111101253 is a deficient number, since it is larger than the sum of its proper divisors (1).
152564111101253 is an equidigital number, since it uses as much as digits as its factorization.
152564111101253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36000, while the sum is 38.
The spelling of 152564111101253 in words is "one hundred fifty-two trillion, five hundred sixty-four billion, one hundred eleven million, one hundred one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •