Base | Representation |
---|---|
bin | 10111010110001101010001… |
… | …01011010100010001011000 |
3 | 20201210002222212200022121120 |
4 | 23223012220223110101120 |
5 | 23212130443422012400 |
6 | 301105311211005240 |
7 | 13546143166513221 |
oct | 1353065053242130 |
9 | 221702885608546 |
10 | 51340574016600 |
11 | 153a446264a500 |
12 | 5912192439820 |
13 | 228551a79b85b |
14 | c96c7b6a2248 |
15 | 5e0745b55ca0 |
hex | 2eb1a8ad4458 |
51340574016600 has 288 divisors, whose sum is σ = 174953105774160. Its totient is φ = 12445254835200.
The previous prime is 51340574016491. The next prime is 51340574016607. The reversal of 51340574016600 is 661047504315.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51340574016607) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1682344542 + ... + 1682375058.
Almost surely, 251340574016600 is an apocalyptic number.
51340574016600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51340574016600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87476552887080).
51340574016600 is an abundant number, since it is smaller than the sum of its proper divisors (123612531757560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51340574016600 is a wasteful number, since it uses less digits than its factorization.
51340574016600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53731 (or 53711 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 51340574016600 in words is "fifty-one trillion, three hundred forty billion, five hundred seventy-four million, sixteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •