Base | Representation |
---|---|
bin | 110100100000… |
… | …1001100010000 |
3 | 1220210200001122 |
4 | 1221001030100 |
5 | 24021430000 |
6 | 2422021412 |
7 | 453000251 |
oct | 151011420 |
9 | 56720048 |
10 | 27530000 |
11 | 145a3773 |
12 | 9277868 |
13 | 591b954 |
14 | 3928b28 |
15 | 263c085 |
hex | 1a41310 |
27530000 has 50 divisors (see below), whose sum is σ = 66677094. Its totient is φ = 11008000.
The previous prime is 27529981. The next prime is 27530017. The reversal of 27530000 is 3572.
27530000 = 233 + 243 + ... + 1023.
It can be written as a sum of positive squares in 5 ways, for example, as 4528384 + 23001616 = 2128^2 + 4796^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 8624 + ... + 11376.
Almost surely, 227530000 is an apocalyptic number.
27530000 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 27530000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33338547).
27530000 is an abundant number, since it is smaller than the sum of its proper divisors (39147094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27530000 is an equidigital number, since it uses as much as digits as its factorization.
27530000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2781 (or 2760 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 17.
The square root of 27530000 is about 5246.9038489380. The cubic root of 27530000 is about 301.9502571465.
Adding to 27530000 its reverse (3572), we get a palindrome (27533572).
The spelling of 27530000 in words is "twenty-seven million, five hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •