Base | Representation |
---|---|
bin | 101111100101111100… |
… | …000011011101100000 |
3 | 11212220102010010212001 |
4 | 233211330003131200 |
5 | 1314124201144121 |
6 | 35250501013344 |
7 | 3456235640305 |
oct | 574574033540 |
9 | 155812103761 |
10 | 51102365536 |
11 | 1a743a53652 |
12 | 9aa20b4254 |
13 | 4a8526b321 |
14 | 268acc70ac |
15 | 14e1546991 |
hex | be5f03760 |
51102365536 has 12 divisors (see below), whose sum is σ = 100607782212. Its totient is φ = 25551182752.
The previous prime is 51102365497. The next prime is 51102365539. The reversal of 51102365536 is 63556320115.
It is a super-2 number, since 2×511023655362 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51102365495 and 51102365504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51102365539) by changing a digit.
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 as a sum of consecutive naturals, namely, 798474430 + ... + 798474493.
It is an arithmetic number, because the mean of its divisors is an integer number (8383981851).
Almost surely, 251102365536 is an apocalyptic number.
It is an amenable number.
51102365536 is a deficient number, since it is larger than the sum of its proper divisors (49505416676).
51102365536 is a wasteful number, since it uses less digits than its factorization.
51102365536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1596948933 (or 1596948925 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 51102365536 in words is "fifty-one billion, one hundred two million, three hundred sixty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •