Base | Representation |
---|---|
bin | 11001110110101100000001… |
… | …11001011101111111101001 |
3 | 21110022020202221101011222111 |
4 | 30323112000321131333221 |
5 | 24423001303012131430 |
6 | 320530355125122321 |
7 | 14655420044520553 |
oct | 1473260071357751 |
9 | 243266687334874 |
10 | 56854644645865 |
11 | 1712aa12783490 |
12 | 64629895593a1 |
13 | 25954a6b1b801 |
14 | 1007acac8c4d3 |
15 | 688dbe3e0c2a |
hex | 33b580e5dfe9 |
56854644645865 has 16 divisors (see below), whose sum is σ = 74429679945600. Its totient is φ = 41347842747520.
The previous prime is 56854644645847. The next prime is 56854644645907.
56854644645865 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56854644645865 - 29 = 56854644645353 is a prime.
It is a super-4 number, since 4×568546446458654 (a number of 56 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 56854644645791 and 56854644645800.
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, 10048909 + ... + 14652298.
It is an arithmetic number, because the mean of its divisors is an integer number (4651854996600).
Almost surely, 256854644645865 is an apocalyptic number.
56854644645865 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56854644645865 is a deficient number, since it is larger than the sum of its proper divisors (17575035299735).
56854644645865 is a wasteful number, since it uses less digits than its factorization.
56854644645865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24743072.
The product of its digits is 13271040000, while the sum is 76.
The spelling of 56854644645865 in words is "fifty-six trillion, eight hundred fifty-four billion, six hundred forty-four million, six hundred forty-five thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •