Base | Representation |
---|---|
bin | 101111100110011001… |
… | …001100100101111001 |
3 | 11212220221111021101100 |
4 | 233212121030211321 |
5 | 1314133130130423 |
6 | 35251332442013 |
7 | 3456360606156 |
oct | 574631144571 |
9 | 155827437340 |
10 | 51110005113 |
11 | 1a7482a1352 |
12 | 9aa4779309 |
13 | 4a86a1469b |
14 | 268bd1522d |
15 | 14e2055343 |
hex | be664c979 |
51110005113 has 12 divisors (see below), whose sum is σ = 78168243348. Its totient is φ = 32069022720.
The previous prime is 51110005097. The next prime is 51110005123. The reversal of 51110005113 is 31150001115.
51110005113 is a `hidden beast` number, since 51 + 1 + 100 + 0 + 511 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 46292534649 + 4817470464 = 215157^2 + 69408^2 .
It is not a de Polignac number, because 51110005113 - 24 = 51110005097 is a prime.
It is a super-2 number, since 2×511100051132 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51110005123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 167026008 + ... + 167026313.
It is an arithmetic number, because the mean of its divisors is an integer number (6514020279).
Almost surely, 251110005113 is an apocalyptic number.
It is an amenable number.
51110005113 is a deficient number, since it is larger than the sum of its proper divisors (27058238235).
51110005113 is a wasteful number, since it uses less digits than its factorization.
51110005113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334052344 (or 334052341 counting only the distinct ones).
The product of its (nonzero) digits is 75, while the sum is 18.
Adding to 51110005113 its reverse (31150001115), we get a palindrome (82260006228).
The spelling of 51110005113 in words is "fifty-one billion, one hundred ten million, five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •