Base | Representation |
---|---|
bin | 10000001110011… |
… | …101000011010110 |
3 | 200222020102202210 |
4 | 100032131003112 |
5 | 1024142140340 |
6 | 43002414250 |
7 | 6513604230 |
oct | 2016350326 |
9 | 628212683 |
10 | 272224470 |
11 | 12a733301 |
12 | 77201386 |
13 | 4452448b |
14 | 28223250 |
15 | 18d74180 |
hex | 1039d0d6 |
272224470 has 64 divisors (see below), whose sum is σ = 762587136. Its totient is φ = 60896640.
The previous prime is 272224399. The next prime is 272224471. The reversal of 272224470 is 74422272.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272224471) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3921 + ... + 23660.
It is an arithmetic number, because the mean of its divisors is an integer number (11915424).
Almost surely, 2272224470 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 272224470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (381293568).
272224470 is an abundant number, since it is smaller than the sum of its proper divisors (490362666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272224470 is a wasteful number, since it uses less digits than its factorization.
272224470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27645.
The product of its (nonzero) digits is 12544, while the sum is 30.
The square root of 272224470 is about 16499.2263454987. The cubic root of 272224470 is about 648.1005454789.
The spelling of 272224470 in words is "two hundred seventy-two million, two hundred twenty-four thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •