Base | Representation |
---|---|
bin | 1000100111100… |
… | …11101011000000 |
3 | 12001001021200000 |
4 | 10103303223000 |
5 | 122002114443 |
6 | 11101400000 |
7 | 1535356545 |
oct | 423635300 |
9 | 161037600 |
10 | 72301248 |
11 | 378a2aa8 |
12 | 20269000 |
13 | 11c96106 |
14 | 9860bcc |
15 | 65328d3 |
hex | 44f3ac0 |
72301248 has 84 divisors (see below), whose sum is σ = 214960200. Its totient is φ = 24095232.
The previous prime is 72301247. The next prime is 72301249. The reversal of 72301248 is 84210327.
It is an interprime number because it is at equal distance from previous prime (72301247) and next prime (72301249).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (72301247) 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, 13228 + ... + 17876.
It is an arithmetic number, because the mean of its divisors is an integer number (2559050).
Almost surely, 272301248 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 72301248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107480100).
72301248 is an abundant number, since it is smaller than the sum of its proper divisors (142658952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72301248 is an equidigital number, since it uses as much as digits as its factorization.
72301248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4676 (or 4654 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 72301248 is about 8503.0140538517. The cubic root of 72301248 is about 416.5961620083.
The spelling of 72301248 in words is "seventy-two million, three hundred one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •