Base | Representation |
---|---|
bin | 11001100000010100000100… |
… | …00001110111001001111001 |
3 | 21100120202102022212012112012 |
4 | 30300022002001313021321 |
5 | 24322402322301233210 |
6 | 315141253534055305 |
7 | 14546033002100345 |
oct | 1460120201671171 |
9 | 240522368765465 |
10 | 56085864477305 |
11 | 16963977384183 |
12 | 635999664a535 |
13 | 253ab49b831a0 |
14 | dbc7dad84625 |
15 | 673dc6d7e305 |
hex | 330282077279 |
56085864477305 has 16 divisors (see below), whose sum is σ = 76743734924304. Its totient is φ = 38980944721920.
The previous prime is 56085864477301. The next prime is 56085864477337. The reversal of 56085864477305 is 50377446858065.
It can be written as a sum of positive squares in 8 ways, for example, as 616795041769 + 55469069435536 = 785363^2 + 7447756^2 .
It is not a de Polignac number, because 56085864477305 - 22 = 56085864477301 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (56085864477301) 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 in 15 ways as a sum of consecutive naturals, for example, 25378218116 + ... + 25378220325.
It is an arithmetic number, because the mean of its divisors is an integer number (4796483432769).
Almost surely, 256085864477305 is an apocalyptic number.
It is an amenable number.
56085864477305 is a deficient number, since it is larger than the sum of its proper divisors (20657870446999).
56085864477305 is a wasteful number, since it uses less digits than its factorization.
56085864477305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50756438476.
The product of its (nonzero) digits is 677376000, while the sum is 68.
The spelling of 56085864477305 in words is "fifty-six trillion, eighty-five billion, eight hundred sixty-four million, four hundred seventy-seven thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •