Base | Representation |
---|---|
bin | 101111110010100011… |
… | …111001000000000000 |
3 | 11220110011121011000000 |
4 | 233302203321000000 |
5 | 1320042404310130 |
6 | 35323504000000 |
7 | 3464416644150 |
oct | 576243710000 |
9 | 156404534000 |
10 | 51314135040 |
11 | 1a842545173 |
12 | 9b41000000 |
13 | 4aba0b671c |
14 | 26ab090760 |
15 | 1504e28260 |
hex | bf28f9000 |
51314135040 has 728 divisors, whose sum is σ = 211428451008. Its totient is φ = 11705057280.
The previous prime is 51314135023. The next prime is 51314135099. The reversal of 51314135040 is 4053141315.
It is a happy number.
51314135040 is a `hidden beast` number, since 5 + 13 + 141 + 3 + 504 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 51314134995 and 51314135013.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 104509195 + ... + 104509685.
Almost surely, 251314135040 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51314135040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105714225504).
51314135040 is an abundant number, since it is smaller than the sum of its proper divisors (160114315968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51314135040 is an frugal number, since it uses more digits than its factorization.
51314135040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545 (or 508 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 51314135040 its reverse (4053141315), we get a palindrome (55367276355).
The spelling of 51314135040 in words is "fifty-one billion, three hundred fourteen million, one hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •