Base | Representation |
---|---|
bin | 11010000010000110… |
… | …010001001100000000 |
3 | 2200011001112100222200 |
4 | 122002012101030000 |
5 | 424221314010440 |
6 | 20501410433200 |
7 | 2006455126500 |
oct | 320206211400 |
9 | 80131470880 |
10 | 27952485120 |
11 | 109444a387a |
12 | 5501292800 |
13 | 2836122831 |
14 | 14d2541a00 |
15 | ad8eccc30 |
hex | 682191300 |
27952485120 has 648 divisors, whose sum is σ = 117448452576. Its totient is φ = 6108512256.
The previous prime is 27952485101. The next prime is 27952485131. The reversal of 27952485120 is 2158425972.
27952485120 is a `hidden beast` number, since 2 + 7 + 95 + 2 + 48 + 512 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 12981964 + ... + 12984116.
It is an arithmetic number, because the mean of its divisors is an integer number (181247612).
Almost surely, 227952485120 is an apocalyptic number.
27952485120 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 27952485120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58724226288).
27952485120 is an abundant number, since it is smaller than the sum of its proper divisors (89495967456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27952485120 is a wasteful number, since it uses less digits than its factorization.
27952485120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2217 (or 2193 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 45.
The spelling of 27952485120 in words is "twenty-seven billion, nine hundred fifty-two million, four hundred eighty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •