Base | Representation |
---|---|
bin | 110000000011110110… |
… | …011111110001001101 |
3 | 11221012101110020202100 |
4 | 300003312133301031 |
5 | 1321141140200401 |
6 | 35412345345313 |
7 | 3504541450602 |
oct | 600366376115 |
9 | 157171406670 |
10 | 51604225101 |
11 | 1a981270120 |
12 | a002198239 |
13 | 4b35224950 |
14 | 26d78046a9 |
15 | 152062ab86 |
hex | c03d9fc4d |
51604225101 has 96 divisors (see below), whose sum is σ = 92844880128. Its totient is φ = 27135313920.
The previous prime is 51604225037. The next prime is 51604225121. The reversal of 51604225101 is 10152240615.
51604225101 is a `hidden beast` number, since 5 + 1 + 604 + 2 + 2 + 51 + 0 + 1 = 666.
It is not a de Polignac number, because 51604225101 - 26 = 51604225037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51604225121) 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 in 95 ways as a sum of consecutive naturals, for example, 27938560 + ... + 27940406.
It is an arithmetic number, because the mean of its divisors is an integer number (967134168).
Almost surely, 251604225101 is an apocalyptic number.
51604225101 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
51604225101 is a deficient number, since it is larger than the sum of its proper divisors (41240655027).
51604225101 is a wasteful number, since it uses less digits than its factorization.
51604225101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3171 (or 3168 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 51604225101 its reverse (10152240615), we get a palindrome (61756465716).
The spelling of 51604225101 in words is "fifty-one billion, six hundred four million, two hundred twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •