Base | Representation |
---|---|
bin | 100000011011000010101… |
… | …1111001101001011111101 |
3 | 120210000000201010202220212 |
4 | 1000312011133031023331 |
5 | 1041002113340324112 |
6 | 13251040310122205 |
7 | 636641552306141 |
oct | 100660537151375 |
9 | 16700021122825 |
10 | 4456120636157 |
11 | 1468914a23603 |
12 | 5bb761950365 |
13 | 26429725cb98 |
14 | 11596aa85221 |
15 | 7ada9760522 |
hex | 40d857cd2fd |
4456120636157 has 2 divisors, whose sum is σ = 4456120636158. Its totient is φ = 4456120636156.
The previous prime is 4456120636147. The next prime is 4456120636183. The reversal of 4456120636157 is 7516360216544.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3770513451961 + 685607184196 = 1941781^2 + 828014^2 .
It is a cyclic number.
It is not a de Polignac number, because 4456120636157 - 220 = 4456119587581 is a prime.
It is a super-2 number, since 2×44561206361572 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4456120636147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2228060318078 + 2228060318079.
It is an arithmetic number, because the mean of its divisors is an integer number (2228060318079).
Almost surely, 24456120636157 is an apocalyptic number.
It is an amenable number.
4456120636157 is a deficient number, since it is larger than the sum of its proper divisors (1).
4456120636157 is an equidigital number, since it uses as much as digits as its factorization.
4456120636157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3628800, while the sum is 50.
The spelling of 4456120636157 in words is "four trillion, four hundred fifty-six billion, one hundred twenty million, six hundred thirty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •