Base | Representation |
---|---|
bin | 110001111010110011… |
… | …111101001110000000 |
3 | 12010100110221120001222 |
4 | 301322303331032000 |
5 | 1334233103014000 |
6 | 40342403014212 |
7 | 3605154614342 |
oct | 617263751600 |
9 | 163313846058 |
10 | 53600048000 |
11 | 20805914434 |
12 | a47a66a368 |
13 | 5092868945 |
14 | 28468d3292 |
15 | 15da965a85 |
hex | c7acfd380 |
53600048000 has 128 divisors (see below), whose sum is σ = 141102842400. Its totient is φ = 20178739200.
The previous prime is 53600047939. The next prime is 53600048027. The reversal of 53600048000 is 84000635.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173471 + ... + 370529.
Almost surely, 253600048000 is an apocalyptic number.
53600048000 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 53600048000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70551421200).
53600048000 is an abundant number, since it is smaller than the sum of its proper divisors (87502794400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53600048000 is a wasteful number, since it uses less digits than its factorization.
53600048000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197105 (or 197083 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 53600048000 its reverse (84000635), we get a palindrome (53684048635).
The spelling of 53600048000 in words is "fifty-three billion, six hundred million, forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •