Base | Representation |
---|---|
bin | 11001101011000101100010… |
… | …00001010001101101000001 |
3 | 21101220010212002212002202012 |
4 | 30311202301001101231001 |
5 | 24344433412112244023 |
6 | 320023312040302305 |
7 | 14614545543342512 |
oct | 1465426101215501 |
9 | 241803762762665 |
10 | 56456020040513 |
11 | 16a96955564485 |
12 | 63b967aa71995 |
13 | 2566a1a425572 |
14 | dd26b3634a09 |
15 | 67d83d62b978 |
hex | 3358b1051b41 |
56456020040513 has 2 divisors, whose sum is σ = 56456020040514. Its totient is φ = 56456020040512.
The previous prime is 56456020040479. The next prime is 56456020040657. The reversal of 56456020040513 is 31504002065465.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48565943531329 + 7890076509184 = 6968927^2 + 2808928^2 .
It is a cyclic number.
It is not a de Polignac number, because 56456020040513 - 26 = 56456020040449 is a prime.
It is a super-2 number, since 2×564560200405132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56456020040113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28228010020256 + 28228010020257.
It is an arithmetic number, because the mean of its divisors is an integer number (28228010020257).
Almost surely, 256456020040513 is an apocalyptic number.
It is an amenable number.
56456020040513 is a deficient number, since it is larger than the sum of its proper divisors (1).
56456020040513 is an equidigital number, since it uses as much as digits as its factorization.
56456020040513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432000, while the sum is 41.
The spelling of 56456020040513 in words is "fifty-six trillion, four hundred fifty-six billion, twenty million, forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •