Base | Representation |
---|---|
bin | 10111001111001110001101… |
… | …10000110100001110011000 |
3 | 20200221011110221002202212122 |
4 | 23213213012300310032120 |
5 | 23144212422003343404 |
6 | 300403135022400412 |
7 | 13522615346262602 |
oct | 1347470660641630 |
9 | 220834427082778 |
10 | 51100560606104 |
11 | 15311698300809 |
12 | 589376a430108 |
13 | 22689ba6b3129 |
14 | c893cd322172 |
15 | 5d939994b3be |
hex | 2e79c6c34398 |
51100560606104 has 32 divisors (see below), whose sum is σ = 96127265052000. Its totient is φ = 25466632888320.
The previous prime is 51100560606101. The next prime is 51100560606131. The reversal of 51100560606104 is 40160606500115.
51100560606104 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×511005606061042 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51100560606101) 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, 42491672 + ... + 43677720.
It is an arithmetic number, because the mean of its divisors is an integer number (3003977032875).
Almost surely, 251100560606104 is an apocalyptic number.
It is an amenable number.
51100560606104 is a deficient number, since it is larger than the sum of its proper divisors (45026704445896).
51100560606104 is a wasteful number, since it uses less digits than its factorization.
51100560606104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203683 (or 1203679 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 51100560606104 in words is "fifty-one trillion, one hundred billion, five hundred sixty million, six hundred six thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •