Base | Representation |
---|---|
bin | 10000001111110… |
… | …000000100000000 |
3 | 200222212201011202 |
4 | 100033300010000 |
5 | 1024234030410 |
6 | 43014000332 |
7 | 6516521426 |
oct | 2017600400 |
9 | 628781152 |
10 | 272564480 |
11 | 12a945801 |
12 | 773460a8 |
13 | 44613176 |
14 | 282b1116 |
15 | 18ddeca5 |
hex | 103f0100 |
272564480 has 72 divisors (see below), whose sum is σ = 662047512. Its totient is φ = 107495424.
The previous prime is 272564477. The next prime is 272564489. The reversal of 272564480 is 84465272.
It can be written as a sum of positive squares in 4 ways, for example, as 121176064 + 151388416 = 11008^2 + 12304^2 .
It is not an unprimeable number, because it can be changed into a prime (272564489) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91982 + ... + 94898.
Almost surely, 2272564480 is an apocalyptic number.
272564480 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 272564480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (331023756).
272564480 is an abundant number, since it is smaller than the sum of its proper divisors (389483032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272564480 is an equidigital number, since it uses as much as digits as its factorization.
272564480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3011 (or 2997 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 38.
The square root of 272564480 is about 16509.5269465845. The cubic root of 272564480 is about 648.3702603777.
The spelling of 272564480 in words is "two hundred seventy-two million, five hundred sixty-four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •