Base | Representation |
---|---|
bin | 110010000100010111… |
… | …010011101100000000 |
3 | 12010202122111201020012 |
4 | 302010113103230000 |
5 | 1340100114410031 |
6 | 40410330004052 |
7 | 3612142044500 |
oct | 620427235400 |
9 | 163678451205 |
10 | 53760310016 |
11 | 20888325686 |
12 | a504276628 |
13 | 50b9b1b73a |
14 | 285dccda00 |
15 | 15e9a70b2b |
hex | c845d3b00 |
53760310016 has 108 divisors (see below), whose sum is σ = 127187589312. Its totient is φ = 22605133824.
The previous prime is 53760310013. The next prime is 53760310033. The reversal of 53760310016 is 61001306735.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (53760310013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 624401 + ... + 705263.
It is an arithmetic number, because the mean of its divisors is an integer number (1177662864).
Almost surely, 253760310016 is an apocalyptic number.
53760310016 is a gapful number since it is divisible by the number (56) 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 53760310016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63593794656).
53760310016 is an abundant number, since it is smaller than the sum of its proper divisors (73427279296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53760310016 is an equidigital number, since it uses as much as digits as its factorization.
53760310016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80946 (or 80925 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 32.
The spelling of 53760310016 in words is "fifty-three billion, seven hundred sixty million, three hundred ten thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •