Base | Representation |
---|---|
bin | 110101000001… |
… | …1100100101100 |
3 | 1221022111001000 |
4 | 1222003210230 |
5 | 24104130100 |
6 | 2431520300 |
7 | 455212050 |
oct | 152034454 |
9 | 57274030 |
10 | 27801900 |
11 | 14769a85 |
12 | 9389090 |
13 | 59b5639 |
14 | 3999c60 |
15 | 2692900 |
hex | 1a8392c |
27801900 has 144 divisors (see below), whose sum is σ = 102215680. Its totient is φ = 6350400.
The previous prime is 27801899. The next prime is 27801913. The reversal of 27801900 is 910872.
It is a super-2 number, since 2×278019002 = 1545891287220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18165 + ... + 19635.
Almost surely, 227801900 is an apocalyptic number.
27801900 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 27801900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51107840).
27801900 is an abundant number, since it is smaller than the sum of its proper divisors (74413780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27801900 is a wasteful number, since it uses less digits than its factorization.
27801900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501 (or 1488 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 27801900 is about 5272.7507052771. The cubic root of 27801900 is about 302.9410727480.
The spelling of 27801900 in words is "twenty-seven million, eight hundred one thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •