Base | Representation |
---|---|
bin | 10000110101010000000… |
… | …010100100000110000101 |
3 | 11002120121122111222201122 |
4 | 100311100002210012011 |
5 | 122422344344131122 |
6 | 2243213044403325 |
7 | 146365555501511 |
oct | 20652002440605 |
9 | 4076548458648 |
10 | 1156689052037 |
11 | 4066048a6922 |
12 | 1682109a6545 |
13 | 850c95bbc4c |
14 | 3ddac331141 |
15 | 2014c6dc142 |
hex | 10d500a4185 |
1156689052037 has 2 divisors, whose sum is σ = 1156689052038. Its totient is φ = 1156689052036.
The previous prime is 1156689051949. The next prime is 1156689052087. The reversal of 1156689052037 is 7302509866511.
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., 1120180924996 + 36508127041 = 1058386^2 + 191071^2 .
It is a cyclic number.
It is not a de Polignac number, because 1156689052037 - 210 = 1156689051013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1156689052037.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1156689052087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 578344526018 + 578344526019.
It is an arithmetic number, because the mean of its divisors is an integer number (578344526019).
Almost surely, 21156689052037 is an apocalyptic number.
It is an amenable number.
1156689052037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1156689052037 is an equidigital number, since it uses as much as digits as its factorization.
1156689052037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2721600, while the sum is 53.
The spelling of 1156689052037 in words is "one trillion, one hundred fifty-six billion, six hundred eighty-nine million, fifty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •