Base | Representation |
---|---|
bin | 1000101001010… |
… | …10011111010100 |
3 | 12001110200200000 |
4 | 10110222133110 |
5 | 122031311110 |
6 | 11110251300 |
7 | 1540313265 |
oct | 424523724 |
9 | 161420600 |
10 | 72525780 |
11 | 37a36768 |
12 | 20356b30 |
13 | 12044382 |
14 | 98bc96c |
15 | 65791c0 |
hex | 452a7d4 |
72525780 has 72 divisors (see below), whose sum is σ = 228158112. Its totient is φ = 19338912.
The previous prime is 72525779. The next prime is 72525787. The reversal of 72525780 is 8752527.
It is a super-3 number, since 3×725257803 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72525787) 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 23 ways as a sum of consecutive naturals, for example, 2602 + ... + 12321.
Almost surely, 272525780 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 72525780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114079056).
72525780 is an abundant number, since it is smaller than the sum of its proper divisors (155632332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72525780 is a wasteful number, since it uses less digits than its factorization.
72525780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14947 (or 14933 counting only the distinct ones).
The product of its (nonzero) digits is 39200, while the sum is 36.
The square root of 72525780 is about 8516.2069021367. The cubic root of 72525780 is about 417.0269637344.
The spelling of 72525780 in words is "seventy-two million, five hundred twenty-five thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •