Base | Representation |
---|---|
bin | 11000010000001111010000… |
… | …01100100010101010100100 |
3 | 20222211201200022200121100202 |
4 | 30020013220030202222210 |
5 | 23442313031124010020 |
6 | 305233311053330032 |
7 | 14143201512230102 |
oct | 1410075014425244 |
9 | 228751608617322 |
10 | 53334504516260 |
11 | 15aa304440a900 |
12 | 5b94701796918 |
13 | 239b564741bb6 |
14 | d25592010c72 |
15 | 627545d6ce75 |
hex | 3081e8322aa4 |
53334504516260 has 288 divisors, whose sum is σ = 125569973088000. Its totient is φ = 19011966336000.
The previous prime is 53334504516259. The next prime is 53334504516299. The reversal of 53334504516260 is 6261540543335.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8670864185 + ... + 8670870335.
It is an arithmetic number, because the mean of its divisors is an integer number (436006851000).
Almost surely, 253334504516260 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 53334504516260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62784986544000).
53334504516260 is an abundant number, since it is smaller than the sum of its proper divisors (72235468571740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53334504516260 is a wasteful number, since it uses less digits than its factorization.
53334504516260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6643 (or 6630 counting only the distinct ones).
The product of its (nonzero) digits is 3888000, while the sum is 47.
The spelling of 53334504516260 in words is "fifty-three trillion, three hundred thirty-four billion, five hundred four million, five hundred sixteen thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •