Base | Representation |
---|---|
bin | 10000010000001… |
… | …101101110000000 |
3 | 201000002212210201 |
4 | 100100031232000 |
5 | 1024301422302 |
6 | 43020334544 |
7 | 6520535530 |
oct | 2020155600 |
9 | 630085721 |
10 | 272685952 |
11 | 12aa18aa0 |
12 | 773a4454 |
13 | 44656546 |
14 | 283034c0 |
15 | 18e15c87 |
hex | 1040db80 |
272685952 has 128 divisors (see below), whose sum is σ = 688377600. Its totient is φ = 104509440.
The previous prime is 272685923. The next prime is 272685971. The reversal of 272685952 is 259586272.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 719299 + ... + 719677.
It is an arithmetic number, because the mean of its divisors is an integer number (5377950).
Almost surely, 2272685952 is an apocalyptic number.
272685952 is a gapful number since it is divisible by the number (22) 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 272685952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (344188800).
272685952 is an abundant number, since it is smaller than the sum of its proper divisors (415691648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272685952 is a wasteful number, since it uses less digits than its factorization.
272685952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484 (or 472 counting only the distinct ones).
The product of its digits is 604800, while the sum is 46.
The square root of 272685952 is about 16513.2053823599. The cubic root of 272685952 is about 648.4665643608.
The spelling of 272685952 in words is "two hundred seventy-two million, six hundred eighty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •