Base | Representation |
---|---|
bin | 1000100101110… |
… | …00001011101000 |
3 | 12000120220102010 |
4 | 10102320023220 |
5 | 121421320301 |
6 | 11052235520 |
7 | 1533323253 |
oct | 422701350 |
9 | 160526363 |
10 | 72057576 |
11 | 37746a18 |
12 | 2016bba0 |
13 | 11c0c226 |
14 | 97da09a |
15 | 64d55d6 |
hex | 44b82e8 |
72057576 has 64 divisors (see below), whose sum is σ = 196200000. Its totient is φ = 21966336.
The previous prime is 72057571. The next prime is 72057589. The reversal of 72057576 is 67575027.
It is not an unprimeable number, because it can be changed into a prime (72057571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10500 + ... + 15948.
It is an arithmetic number, because the mean of its divisors is an integer number (3065625).
Almost surely, 272057576 is an apocalyptic number.
72057576 is a gapful number since it is divisible by the number (76) 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 72057576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98100000).
72057576 is an abundant number, since it is smaller than the sum of its proper divisors (124142424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72057576 is a wasteful number, since it uses less digits than its factorization.
72057576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5506 (or 5502 counting only the distinct ones).
The product of its (nonzero) digits is 102900, while the sum is 39.
The square root of 72057576 is about 8488.6733945888. The cubic root of 72057576 is about 416.1276266446.
The spelling of 72057576 in words is "seventy-two million, fifty-seven thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •