Base | Representation |
---|---|
bin | 110100011100101000… |
… | …010001010101000101 |
3 | 12101100200102000011101 |
4 | 310130220101111011 |
5 | 1410313103044022 |
6 | 41512023340101 |
7 | 4032351461242 |
oct | 643450212505 |
9 | 171320360141 |
10 | 56314893637 |
11 | 21979320112 |
12 | aab78b1631 |
13 | 540614c692 |
14 | 2a232ac5c9 |
15 | 16e8e7e627 |
hex | d1ca11545 |
56314893637 has 2 divisors, whose sum is σ = 56314893638. Its totient is φ = 56314893636.
The previous prime is 56314893599. The next prime is 56314893671. The reversal of 56314893637 is 73639841365.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53958179521 + 2356714116 = 232289^2 + 48546^2 .
It is a cyclic number.
It is not a de Polignac number, because 56314893637 - 215 = 56314860869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56314893137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28157446818 + 28157446819.
It is an arithmetic number, because the mean of its divisors is an integer number (28157446819).
Almost surely, 256314893637 is an apocalyptic number.
It is an amenable number.
56314893637 is a deficient number, since it is larger than the sum of its proper divisors (1).
56314893637 is an equidigital number, since it uses as much as digits as its factorization.
56314893637 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9797760, while the sum is 55.
The spelling of 56314893637 in words is "fifty-six billion, three hundred fourteen million, eight hundred ninety-three thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •