Base | Representation |
---|---|
bin | 10111011100100111000111… |
… | …00010111100100001011101 |
3 | 20202120010221012210220022220 |
4 | 23232103203202330201131 |
5 | 23224232104340310023 |
6 | 301354340454455553 |
7 | 13601062600221021 |
oct | 1356234342744135 |
9 | 222503835726286 |
10 | 51560605010013 |
11 | 15479803389510 |
12 | 594895a3645b9 |
13 | 22a01b4a27848 |
14 | ca3791c16381 |
15 | 5e63229193e3 |
hex | 2ee4e38bc85d |
51560605010013 has 32 divisors (see below), whose sum is σ = 77925132725760. Its totient is φ = 30038391552960.
The previous prime is 51560605010011. The next prime is 51560605010017. The reversal of 51560605010013 is 31001050606515.
It is not a de Polignac number, because 51560605010013 - 21 = 51560605010011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51560605010011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118455295 + ... + 118889772.
It is an arithmetic number, because the mean of its divisors is an integer number (2435160397680).
Almost surely, 251560605010013 is an apocalyptic number.
It is an amenable number.
51560605010013 is a deficient number, since it is larger than the sum of its proper divisors (26364527715747).
51560605010013 is a wasteful number, since it uses less digits than its factorization.
51560605010013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237345337.
The product of its (nonzero) digits is 13500, while the sum is 33.
Adding to 51560605010013 its reverse (31001050606515), we get a palindrome (82561655616528).
The spelling of 51560605010013 in words is "fifty-one trillion, five hundred sixty billion, six hundred five million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •