Base | Representation |
---|---|
bin | 1000100101100… |
… | …11001000000000 |
3 | 12000112212000000 |
4 | 10102303020000 |
5 | 121420134424 |
6 | 11052000000 |
7 | 1533206004 |
oct | 422631000 |
9 | 160485000 |
10 | 72036864 |
11 | 377323a9 |
12 | 20160000 |
13 | 11c02983 |
14 | 97d2704 |
15 | 64ce3c9 |
hex | 44b3200 |
72036864 has 140 divisors (see below), whose sum is σ = 216918966. Its totient is φ = 23887872.
The previous prime is 72036829. The next prime is 72036869. The reversal of 72036864 is 46863027.
It can be written as a sum of positive squares in only one way, i.e., 67371264 + 4665600 = 8208^2 + 2160^2 .
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 (72036869) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 373152 + ... + 373344.
Almost surely, 272036864 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 72036864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108459483).
72036864 is an abundant number, since it is smaller than the sum of its proper divisors (144882102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72036864 is an frugal number, since it uses more digits than its factorization.
72036864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229 (or 198 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 72036864 is about 8487.4533282958. The cubic root of 72036864 is about 416.0877526910.
It can be divided in two parts, 72036 and 864, that added together give a square (72900 = 2702).
The spelling of 72036864 in words is "seventy-two million, thirty-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •