Base | Representation |
---|---|
bin | 11001110101110101011100… |
… | …11101101110001001100001 |
3 | 21110012110010221201002011110 |
4 | 30322322232131232021201 |
5 | 24422011301123242430 |
6 | 320505111450133533 |
7 | 14653332002243034 |
oct | 1472725635561141 |
9 | 243173127632143 |
10 | 56825344352865 |
11 | 171195474a9700 |
12 | 6459170a212a9 |
13 | 25927b76c262a |
14 | 100650b74301b |
15 | 688256e2c7b0 |
hex | 33aeae76e261 |
56825344352865 has 48 divisors (see below), whose sum is σ = 102638477801664. Its totient is φ = 26807042021760.
The previous prime is 56825344352827. The next prime is 56825344352879.
56825344352865 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56825344352865 - 26 = 56825344352801 is a prime.
It is a super-2 number, since 2×568253443528652 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56825344352796 and 56825344352805.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 423023787 + ... + 423158096.
It is an arithmetic number, because the mean of its divisors is an integer number (2138301620868).
Almost surely, 256825344352865 is an apocalyptic number.
56825344352865 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56825344352865 is a deficient number, since it is larger than the sum of its proper divisors (45813133448799).
56825344352865 is a wasteful number, since it uses less digits than its factorization.
56825344352865 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 846181950 (or 846181939 counting only the distinct ones).
The product of its digits is 829440000, while the sum is 66.
The spelling of 56825344352865 in words is "fifty-six trillion, eight hundred twenty-five billion, three hundred forty-four million, three hundred fifty-two thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •