Base | Representation |
---|---|
bin | 110100101000100001… |
… | …010111100010011011 |
3 | 12101212120211112001102 |
4 | 310220201113202123 |
5 | 1411220142120101 |
6 | 41543511542015 |
7 | 4040323364426 |
oct | 645041274233 |
9 | 171776745042 |
10 | 56514410651 |
11 | 21a70a03206 |
12 | ab5268a90b |
13 | 5438597b9a |
14 | 2a419a69bd |
15 | 170b74086b |
hex | d2885789b |
56514410651 has 2 divisors, whose sum is σ = 56514410652. Its totient is φ = 56514410650.
The previous prime is 56514410639. The next prime is 56514410663. The reversal of 56514410651 is 15601441565.
It is a balanced prime because it is at equal distance from previous prime (56514410639) and next prime (56514410663).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56514410651 is a prime.
It is a super-2 number, since 2×565144106512 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (56514410671) 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, 28257205325 + 28257205326.
It is an arithmetic number, because the mean of its divisors is an integer number (28257205326).
Almost surely, 256514410651 is an apocalyptic number.
56514410651 is a deficient number, since it is larger than the sum of its proper divisors (1).
56514410651 is an equidigital number, since it uses as much as digits as its factorization.
56514410651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 38.
The spelling of 56514410651 in words is "fifty-six billion, five hundred fourteen million, four hundred ten thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •