Base | Representation |
---|---|
bin | 10111001111001110010010… |
… | …11100011111100000000010 |
3 | 20200221011121001210012121002 |
4 | 23213213021130133200002 |
5 | 23144213020014004421 |
6 | 300403143311132002 |
7 | 13522616433641342 |
oct | 1347471134374002 |
9 | 220834531705532 |
10 | 51100605609986 |
11 | 153117107498a9 |
12 | 5893781514002 |
13 | 22689c6b0c44a |
14 | c893d52b8d22 |
15 | 5d939d88ab0b |
hex | 2e79c971f802 |
51100605609986 has 16 divisors (see below), whose sum is σ = 81187121271960. Its totient is φ = 24039244293120.
The previous prime is 51100605609983. The next prime is 51100605610007. The reversal of 51100605609986 is 68990650600115.
It is a happy number.
51100605609986 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 27990289642225 + 23110315967761 = 5290585^2 + 4807319^2 .
It is a super-2 number, since 2×511006056099862 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51100605609983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253007675 + ... + 253209566.
Almost surely, 251100605609986 is an apocalyptic number.
51100605609986 is a deficient number, since it is larger than the sum of its proper divisors (30086515661974).
51100605609986 is a wasteful number, since it uses less digits than its factorization.
51100605609986 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506220229.
The product of its (nonzero) digits is 3499200, while the sum is 56.
The spelling of 51100605609986 in words is "fifty-one trillion, one hundred billion, six hundred five million, six hundred nine thousand, nine hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •