Base | Representation |
---|---|
bin | 101111100110011001… |
… | …001100100101110001 |
3 | 11212220221111021101001 |
4 | 233212121030211301 |
5 | 1314133130130410 |
6 | 35251332442001 |
7 | 3456360606145 |
oct | 574631144561 |
9 | 155827437331 |
10 | 51110005105 |
11 | 1a7482a1345 |
12 | 9aa4779301 |
13 | 4a86a14693 |
14 | 268bd15225 |
15 | 14e205533a |
hex | be664c971 |
51110005105 has 32 divisors (see below), whose sum is σ = 64546748928. Its totient is φ = 38776320000.
The previous prime is 51110005097. The next prime is 51110005123. The reversal of 51110005105 is 50150001115.
It is a happy number.
It is not a de Polignac number, because 51110005105 - 23 = 51110005097 is a prime.
It is a super-2 number, since 2×511100051052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 10017055 + ... + 10022155.
It is an arithmetic number, because the mean of its divisors is an integer number (2017085904).
Almost surely, 251110005105 is an apocalyptic number.
It is an amenable number.
51110005105 is a deficient number, since it is larger than the sum of its proper divisors (13436743823).
51110005105 is a wasteful number, since it uses less digits than its factorization.
51110005105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5857.
The product of its (nonzero) digits is 125, while the sum is 19.
The spelling of 51110005105 in words is "fifty-one billion, one hundred ten million, five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •