Base | Representation |
---|---|
bin | 1000101001001… |
… | …11000011100001 |
3 | 12001102222101000 |
4 | 10110213003201 |
5 | 122030333323 |
6 | 11110102213 |
7 | 1540224261 |
oct | 424470341 |
9 | 161388330 |
10 | 72511713 |
11 | 37a2713a |
12 | 2034a969 |
13 | 1203ab51 |
14 | 98b77a1 |
15 | 6574e43 |
hex | 45270e1 |
72511713 has 16 divisors (see below), whose sum is σ = 108203200. Its totient is φ = 47993364.
The previous prime is 72511711. The next prime is 72511723. The reversal of 72511713 is 31711527.
It is a happy number.
The cubic root of 72511713 is 417.
It is a perfect power (a cube), and thus also a powerful number.
It is not a de Polignac number, because 72511713 - 21 = 72511711 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (72511711) 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 15 ways as a sum of consecutive naturals, for example, 521598 + ... + 521736.
It is an arithmetic number, because the mean of its divisors is an integer number (6762700).
Almost surely, 272511713 is an apocalyptic number.
It is an amenable number.
72511713 is a deficient number, since it is larger than the sum of its proper divisors (35691487).
72511713 is an frugal number, since it uses more digits than its factorization.
72511713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426 (or 142 counting only the distinct ones).
The product of its digits is 1470, while the sum is 27.
The square root of 72511713 is about 8515.3809662281.
Multiplying 72511713 by its sum of digits (27), we get a cube (1957816251 = 12513).
72511713 divided by its sum of digits (27) gives a cube (2685619 = 1393).
The spelling of 72511713 in words is "seventy-two million, five hundred eleven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •