Base | Representation |
---|---|
bin | 1000100111000… |
… | …11111001011000 |
3 | 12000221000000211 |
4 | 10103203321120 |
5 | 121443033012 |
6 | 11100140504 |
7 | 1535000266 |
oct | 423437130 |
9 | 160830024 |
10 | 72236632 |
11 | 378594a6 |
12 | 20237734 |
13 | 11c72890 |
14 | 9845436 |
15 | 651d6a7 |
hex | 44e3e58 |
72236632 has 64 divisors (see below), whose sum is σ = 155232000. Its totient is φ = 31238784.
The previous prime is 72236611. The next prime is 72236683. The reversal of 72236632 is 23663227.
It is a junction number, because it is equal to n+sod(n) for n = 72236594 and 72236603.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 274533 + ... + 274795.
It is an arithmetic number, because the mean of its divisors is an integer number (2425500).
Almost surely, 272236632 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 72236632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77616000).
72236632 is an abundant number, since it is smaller than the sum of its proper divisors (82995368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72236632 is a wasteful number, since it uses less digits than its factorization.
72236632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440 (or 436 counting only the distinct ones).
The product of its digits is 18144, while the sum is 31.
The square root of 72236632 is about 8499.2136106819. The cubic root of 72236632 is about 416.4720203026.
Adding to 72236632 its reverse (23663227), we get a palindrome (95899859).
The spelling of 72236632 in words is "seventy-two million, two hundred thirty-six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •