Base | Representation |
---|---|
bin | 1000101010100… |
… | …10100110000000 |
3 | 12001210001000000 |
4 | 10111102212000 |
5 | 122102040143 |
6 | 11114000000 |
7 | 1541566224 |
oct | 425224600 |
9 | 161701000 |
10 | 72690048 |
11 | 38039122 |
12 | 20416000 |
13 | 120a1082 |
14 | 9922784 |
15 | 65acbd3 |
hex | 4552980 |
72690048 has 224 divisors, whose sum is σ = 234120600. Its totient is φ = 22394880.
The previous prime is 72690047. The next prime is 72690049. The reversal of 72690048 is 84009627.
It is an interprime number because it is at equal distance from previous prime (72690047) and next prime (72690049).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 72689994 and 72690021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72690047) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 1772908 + ... + 1772948.
Almost surely, 272690048 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 72690048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117060300).
72690048 is an abundant number, since it is smaller than the sum of its proper divisors (161430552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72690048 is an equidigital number, since it uses as much as digits as its factorization.
72690048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 72690048 is about 8525.8458817879. The cubic root of 72690048 is about 417.3415761408.
The spelling of 72690048 in words is "seventy-two million, six hundred ninety thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •