Base | Representation |
---|---|
bin | 11001010100100011… |
… | …001111001010000000 |
3 | 2121011210122010011120 |
4 | 121110203033022000 |
5 | 421140202431130 |
6 | 20253512112240 |
7 | 1651515652410 |
oct | 312443171200 |
9 | 77153563146 |
10 | 27188327040 |
11 | 10592113576 |
12 | 5329395680 |
13 | 2743a0b9a4 |
14 | 145cc66640 |
15 | a91d85910 |
hex | 6548cf280 |
27188327040 has 256 divisors, whose sum is σ = 99209214720. Its totient is φ = 6204063744.
The previous prime is 27188327029. The next prime is 27188327063. The reversal of 27188327040 is 4072388172.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 27188326983 and 27188327001.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10387812 + ... + 10390428.
It is an arithmetic number, because the mean of its divisors is an integer number (387535995).
Almost surely, 227188327040 is an apocalyptic number.
27188327040 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 27188327040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49604607360).
27188327040 is an abundant number, since it is smaller than the sum of its proper divisors (72020887680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27188327040 is a wasteful number, since it uses less digits than its factorization.
27188327040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3419 (or 3407 counting only the distinct ones).
The product of its (nonzero) digits is 150528, while the sum is 42.
The spelling of 27188327040 in words is "twenty-seven billion, one hundred eighty-eight million, three hundred twenty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •