Base | Representation |
---|---|
bin | 10000100010000100000… |
… | …110000101110101111101 |
3 | 11000121102220011112021122 |
4 | 100202010012011311331 |
5 | 122103201403233303 |
6 | 2225524511040325 |
7 | 145036210613324 |
oct | 20420406056575 |
9 | 4017386145248 |
10 | 1136087555453 |
11 | 3a88a2897594 |
12 | 1642215100a5 |
13 | 83195413496 |
14 | 3cdb61d30bb |
15 | 1e843c59e38 |
hex | 10884185d7d |
1136087555453 has 2 divisors, whose sum is σ = 1136087555454. Its totient is φ = 1136087555452.
The previous prime is 1136087555441. The next prime is 1136087555489. The reversal of 1136087555453 is 3545557806311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1091561069284 + 44526486169 = 1044778^2 + 211013^2 .
It is a cyclic number.
It is not a de Polignac number, because 1136087555453 - 24 = 1136087555437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1136087555395 and 1136087555404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1136087554453) 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, 568043777726 + 568043777727.
It is an arithmetic number, because the mean of its divisors is an integer number (568043777727).
Almost surely, 21136087555453 is an apocalyptic number.
It is an amenable number.
1136087555453 is a deficient number, since it is larger than the sum of its proper divisors (1).
1136087555453 is an equidigital number, since it uses as much as digits as its factorization.
1136087555453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560000, while the sum is 53.
The spelling of 1136087555453 in words is "one trillion, one hundred thirty-six billion, eighty-seven million, five hundred fifty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •