Base | Representation |
---|---|
bin | 110100100101010010… |
… | …111101101010000000 |
3 | 12101201211000120021110 |
4 | 310211102331222000 |
5 | 1411112314143401 |
6 | 41534300123320 |
7 | 4036065441210 |
oct | 644522755200 |
9 | 171654016243 |
10 | 56460302976 |
11 | 21a43407320 |
12 | ab38536540 |
13 | 542a301bcc |
14 | 2a38720240 |
15 | 1706b039d6 |
hex | d254bda80 |
56460302976 has 384 divisors, whose sum is σ = 193302305280. Its totient is φ = 14184806400.
The previous prime is 56460302897. The next prime is 56460303013. The reversal of 56460302976 is 67920306465.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28413855 + ... + 28415841.
It is an arithmetic number, because the mean of its divisors is an integer number (503391420).
Almost surely, 256460302976 is an apocalyptic number.
56460302976 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 56460302976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96651152640).
56460302976 is an abundant number, since it is smaller than the sum of its proper divisors (136842002304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56460302976 is a wasteful number, since it uses less digits than its factorization.
56460302976 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2084 (or 2041 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 48.
The spelling of 56460302976 in words is "fifty-six billion, four hundred sixty million, three hundred two thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •