Base | Representation |
---|---|
bin | 10000001110000… |
… | …000011111010000 |
3 | 200222000111021112 |
4 | 100032000133100 |
5 | 1024124414342 |
6 | 43000112452 |
7 | 6512606150 |
oct | 2016003720 |
9 | 628014245 |
10 | 272107472 |
11 | 12a66340a |
12 | 77165728 |
13 | 444b3150 |
14 | 281d2760 |
15 | 18d4e682 |
hex | 103807d0 |
272107472 has 80 divisors (see below), whose sum is σ = 666540672. Its totient is φ = 104716800.
The previous prime is 272107463. The next prime is 272107477. The reversal of 272107472 is 274701272.
It is a happy number.
272107472 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272107477) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51347 + ... + 56397.
Almost surely, 2272107472 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 272107472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (333270336).
272107472 is an abundant number, since it is smaller than the sum of its proper divisors (394433200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272107472 is a wasteful number, since it uses less digits than its factorization.
272107472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5116 (or 5110 counting only the distinct ones).
The product of its (nonzero) digits is 10976, while the sum is 32.
The square root of 272107472 is about 16495.6804042755. The cubic root of 272107472 is about 648.0076842050.
The spelling of 272107472 in words is "two hundred seventy-two million, one hundred seven thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •