Base | Representation |
---|---|
bin | 1000101011000… |
… | …01010110101110 |
3 | 12001220002221100 |
4 | 10111201112232 |
5 | 122111004020 |
6 | 11115143530 |
7 | 1542240420 |
oct | 425412656 |
9 | 161802840 |
10 | 72750510 |
11 | 3807a598 |
12 | 20444ba6 |
13 | 120c2751 |
14 | 993a810 |
15 | 65c0a90 |
hex | 45615ae |
72750510 has 96 divisors (see below), whose sum is σ = 222086592. Its totient is φ = 16174080.
The previous prime is 72750499. The next prime is 72750511. The reversal of 72750510 is 1505727.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72750511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21750 + ... + 24870.
It is an arithmetic number, because the mean of its divisors is an integer number (2313402).
Almost surely, 272750510 is an apocalyptic number.
72750510 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 72750510, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111043296).
72750510 is an abundant number, since it is smaller than the sum of its proper divisors (149336082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72750510 is a wasteful number, since it uses less digits than its factorization.
72750510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3178 (or 3175 counting only the distinct ones).
The product of its (nonzero) digits is 2450, while the sum is 27.
The square root of 72750510 is about 8529.3909512931. The cubic root of 72750510 is about 417.4572559536.
The spelling of 72750510 in words is "seventy-two million, seven hundred fifty thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •