Base | Representation |
---|---|
bin | 1000100101101… |
… | …10101101000000 |
3 | 12000120121002211 |
4 | 10102312231000 |
5 | 121421122040 |
6 | 11052151504 |
7 | 1533266512 |
oct | 422665500 |
9 | 160517084 |
10 | 72051520 |
11 | 37742412 |
12 | 20168594 |
13 | 11c09548 |
14 | 97d7bb2 |
15 | 64d38ea |
hex | 44b6b40 |
72051520 has 28 divisors (see below), whose sum is σ = 171573444. Its totient is φ = 28820480.
The previous prime is 72051509. The next prime is 72051527. The reversal of 72051520 is 2515027.
It can be written as a sum of positive squares in 2 ways, for example, as 7795264 + 64256256 = 2792^2 + 8016^2 .
It is a junction number, because it is equal to n+sod(n) for n = 72051491 and 72051500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72051527) 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 3 ways as a sum of consecutive naturals, for example, 112261 + ... + 112900.
It is an arithmetic number, because the mean of its divisors is an integer number (6127623).
Almost surely, 272051520 is an apocalyptic number.
It is an amenable number.
72051520 is an abundant number, since it is smaller than the sum of its proper divisors (99521924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72051520 is a wasteful number, since it uses less digits than its factorization.
72051520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225178 (or 225168 counting only the distinct ones).
The product of its (nonzero) digits is 700, while the sum is 22.
The square root of 72051520 is about 8488.3166764677. The cubic root of 72051520 is about 416.1159686545.
Adding to 72051520 its reverse (2515027), we get a palindrome (74566547).
The spelling of 72051520 in words is "seventy-two million, fifty-one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •