Base | Representation |
---|---|
bin | 101111100110000010… |
… | …010110001011001101 |
3 | 11212220112012221120021 |
4 | 233212002112023031 |
5 | 1314130111440203 |
6 | 35251000222141 |
7 | 3456255650350 |
oct | 574602261315 |
9 | 155815187507 |
10 | 51104015053 |
11 | 1a74497a993 |
12 | 9aa276a951 |
13 | 4a856c8080 |
14 | 268b1d6297 |
15 | 14e17705bd |
hex | be60962cd |
51104015053 has 8 divisors (see below), whose sum is σ = 62897249408. Its totient is φ = 40433945904.
The previous prime is 51104015051. The next prime is 51104015141. The reversal of 51104015053 is 35051040115.
It is a happy number.
51104015053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51104015053 - 21 = 51104015051 is a prime.
It is a super-2 number, since 2×511040150532 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51104015051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 280791201 + ... + 280791382.
It is an arithmetic number, because the mean of its divisors is an integer number (7862156176).
Almost surely, 251104015053 is an apocalyptic number.
It is an amenable number.
51104015053 is a deficient number, since it is larger than the sum of its proper divisors (11793234355).
51104015053 is a wasteful number, since it uses less digits than its factorization.
51104015053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 561582603.
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 51104015053 its reverse (35051040115), we get a palindrome (86155055168).
The spelling of 51104015053 in words is "fifty-one billion, one hundred four million, fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •