Base | Representation |
---|---|
bin | 1001000101010110000… |
… | …1011000011001111001 |
3 | 112220210122110010022022 |
4 | 2101111201120121321 |
5 | 10024044212333404 |
6 | 155405015004225 |
7 | 14163104011634 |
oct | 2212541303171 |
9 | 486718403268 |
10 | 156053636729 |
11 | 60200234011 |
12 | 262b2069675 |
13 | 1193c7a7a23 |
14 | 77a5762c1b |
15 | 40d52ae8be |
hex | 2455858679 |
156053636729 has 2 divisors, whose sum is σ = 156053636730. Its totient is φ = 156053636728.
The previous prime is 156053636639. The next prime is 156053636731. The reversal of 156053636729 is 927636350651.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149123407225 + 6930229504 = 386165^2 + 83248^2 .
It is an emirp because it is prime and its reverse (927636350651) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-156053636729 is a prime.
Together with 156053636731, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (156053636429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78026818364 + 78026818365.
It is an arithmetic number, because the mean of its divisors is an integer number (78026818365).
Almost surely, 2156053636729 is an apocalyptic number.
It is an amenable number.
156053636729 is a deficient number, since it is larger than the sum of its proper divisors (1).
156053636729 is an equidigital number, since it uses as much as digits as its factorization.
156053636729 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6123600, while the sum is 53.
The spelling of 156053636729 in words is "one hundred fifty-six billion, fifty-three million, six hundred thirty-six thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •