Base | Representation |
---|---|
bin | 110000000111011010… |
… | …100100111011001101 |
3 | 11221100112221220011000 |
4 | 300013122210323031 |
5 | 1321301441440203 |
6 | 35422323050513 |
7 | 3506165611410 |
oct | 600732447315 |
9 | 157315856130 |
10 | 51664015053 |
11 | 1aa01a98202 |
12 | a01a210a39 |
13 | 4b4472a111 |
14 | 2701729b77 |
15 | 15259db4a3 |
hex | c076a4ecd |
51664015053 has 128 divisors (see below), whose sum is σ = 97929216000. Its totient is φ = 26205742080.
The previous prime is 51664015043. The next prime is 51664015093. The reversal of 51664015053 is 35051046615.
51664015053 is a `hidden beast` number, since 5 + 1 + 6 + 640 + 1 + 5 + 0 + 5 + 3 = 666.
51664015053 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 51664015053 - 29 = 51664014541 is a prime.
It is a super-2 number, since 2×516640150532 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51664014999 and 51664015017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51664015043) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 14588463 + ... + 14592003.
It is an arithmetic number, because the mean of its divisors is an integer number (765072000).
Almost surely, 251664015053 is an apocalyptic number.
It is an amenable number.
51664015053 is a deficient number, since it is larger than the sum of its proper divisors (46265200947).
51664015053 is a wasteful number, since it uses less digits than its factorization.
51664015053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3832 (or 3826 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 51664015053 in words is "fifty-one billion, six hundred sixty-four million, fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •