Base | Representation |
---|---|
bin | 110100111001100110… |
… | …111101000001100001 |
3 | 12102121120021012212122 |
4 | 310321212331001201 |
5 | 1412312034300320 |
6 | 42032152234025 |
7 | 4050404164304 |
oct | 647146750141 |
9 | 172546235778 |
10 | 56801087585 |
11 | 220a88078a0 |
12 | b01269b915 |
13 | 5482aac6c8 |
14 | 2a6baacb3b |
15 | 17269bbd25 |
hex | d399bd061 |
56801087585 has 16 divisors (see below), whose sum is σ = 74647135872. Its totient is φ = 41149132800.
The previous prime is 56801087543. The next prime is 56801087627. The reversal of 56801087585 is 58578010865.
56801087585 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (56801087543) and next prime (56801087627).
It is not a de Polignac number, because 56801087585 - 26 = 56801087521 is a prime.
It is a super-2 number, since 2×568010875852 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1995101 + ... + 2023370.
It is an arithmetic number, because the mean of its divisors is an integer number (4665445992).
Almost surely, 256801087585 is an apocalyptic number.
56801087585 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56801087585 is a deficient number, since it is larger than the sum of its proper divisors (17846048287).
56801087585 is a wasteful number, since it uses less digits than its factorization.
56801087585 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4018744.
The product of its (nonzero) digits is 2688000, while the sum is 53.
The spelling of 56801087585 in words is "fifty-six billion, eight hundred one million, eighty-seven thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •