Base | Representation |
---|---|
bin | 101111100101111100… |
… | …100001001001100001 |
3 | 11212220102100022122210 |
4 | 233211330201021201 |
5 | 1314124214042022 |
6 | 35250503352333 |
7 | 3456236654652 |
oct | 574574411141 |
9 | 155812308583 |
10 | 51102487137 |
11 | 1a744026a49 |
12 | 9aa21526a9 |
13 | 4a852b1790 |
14 | 268ad19529 |
15 | 14e156ca0c |
hex | be5f21261 |
51102487137 has 32 divisors (see below), whose sum is σ = 77792189440. Its totient is φ = 29610696960.
The previous prime is 51102487109. The next prime is 51102487159. The reversal of 51102487137 is 73178420115.
It is a happy number.
51102487137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51102487137 - 214 = 51102470753 is a prime.
It is a super-2 number, since 2×511024871372 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51102487095 and 51102487104.
It is not an unprimeable number, because it can be changed into a prime (51102488137) 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, 526462 + ... + 615927.
It is an arithmetic number, because the mean of its divisors is an integer number (2431005920).
Almost surely, 251102487137 is an apocalyptic number.
It is an amenable number.
51102487137 is a deficient number, since it is larger than the sum of its proper divisors (26689702303).
51102487137 is a wasteful number, since it uses less digits than its factorization.
51102487137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1142473.
The product of its (nonzero) digits is 47040, while the sum is 39.
The spelling of 51102487137 in words is "fifty-one billion, one hundred two million, four hundred eighty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •