Base | Representation |
---|---|
bin | 1000100111001… |
… | …00110111011110 |
3 | 12000221012111000 |
4 | 10103210313132 |
5 | 121443144411 |
6 | 11100211130 |
7 | 1535015004 |
oct | 423446736 |
9 | 160835430 |
10 | 72240606 |
11 | 37861489 |
12 | 20239aa6 |
13 | 11c74629 |
14 | 9846a74 |
15 | 651e956 |
hex | 44e4dde |
72240606 has 64 divisors (see below), whose sum is σ = 167247360. Its totient is φ = 23094720.
The previous prime is 72240587. The next prime is 72240659. The reversal of 72240606 is 60604227.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 72240606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 148095 + ... + 148581.
It is an arithmetic number, because the mean of its divisors is an integer number (2613240).
Almost surely, 272240606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 72240606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83623680).
72240606 is an abundant number, since it is smaller than the sum of its proper divisors (95006754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72240606 is a wasteful number, since it uses less digits than its factorization.
72240606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606 (or 600 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 72240606 is about 8499.4473938016. The cubic root of 72240606 is about 416.4796573764.
It can be divided in two parts, 722 and 40606, that added together give a triangular number (41328 = T287).
The spelling of 72240606 in words is "seventy-two million, two hundred forty thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •