Base | Representation |
---|---|
bin | 101111100110011011… |
… | …010100010011110101 |
3 | 11212220222112111221020 |
4 | 233212123110103311 |
5 | 1314133300423023 |
6 | 35251352411353 |
7 | 3456365412651 |
oct | 574633242365 |
9 | 155828474836 |
10 | 51110561013 |
11 | 1a748640a76 |
12 | 9aa49a6b59 |
13 | 4a86b7a715 |
14 | 268c01ba61 |
15 | 14e2114de3 |
hex | be66d44f5 |
51110561013 has 32 divisors (see below), whose sum is σ = 76149590400. Its totient is φ = 30303184896.
The previous prime is 51110561011. The next prime is 51110561027. The reversal of 51110561013 is 31016501115.
It is a happy number.
It is not a de Polignac number, because 51110561013 - 21 = 51110561011 is a prime.
It is a super-2 number, since 2×511105610132 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51110561011) 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, 309145 + ... + 444737.
It is an arithmetic number, because the mean of its divisors is an integer number (2379674700).
Almost surely, 251110561013 is an apocalyptic number.
It is an amenable number.
51110561013 is a deficient number, since it is larger than the sum of its proper divisors (25039029387).
51110561013 is a wasteful number, since it uses less digits than its factorization.
51110561013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136021.
The product of its (nonzero) digits is 450, while the sum is 24.
The spelling of 51110561013 in words is "fifty-one billion, one hundred ten million, five hundred sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •