Base | Representation |
---|---|
bin | 10111011111000100010101… |
… | …10010101100111011110000 |
3 | 20202212012210220200122020220 |
4 | 23233202022302230323300 |
5 | 23232122442410023120 |
6 | 301501220440333040 |
7 | 13610141424035142 |
oct | 1357421262547360 |
9 | 222765726618226 |
10 | 51645015314160 |
11 | 15501589842354 |
12 | 5961197174180 |
13 | 22a814778c788 |
14 | ca78bc5ccc92 |
15 | 5e86131a9b40 |
hex | 2ef88acacef0 |
51645015314160 has 80 divisors (see below), whose sum is σ = 165620221547040. Its totient is φ = 13297107389440.
The previous prime is 51645015314029. The next prime is 51645015314161. The reversal of 51645015314160 is 6141351054615.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51645015314161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3710123451 + ... + 3710137370.
It is an arithmetic number, because the mean of its divisors is an integer number (2070252769338).
Almost surely, 251645015314160 is an apocalyptic number.
It is an amenable number.
51645015314160 is an abundant number, since it is smaller than the sum of its proper divisors (113975206232880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51645015314160 is a wasteful number, since it uses less digits than its factorization.
51645015314160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7420260866 (or 7420260860 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 42.
Adding to 51645015314160 its reverse (6141351054615), we get a palindrome (57786366368775).
The spelling of 51645015314160 in words is "fifty-one trillion, six hundred forty-five billion, fifteen million, three hundred fourteen thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •