Base | Representation |
---|---|
bin | 11001001101011000… |
… | …101001100110110000 |
3 | 2120212102102112011000 |
4 | 121031120221212300 |
5 | 420413414030110 |
6 | 20233535322000 |
7 | 1645526102220 |
oct | 311530514660 |
9 | 76772375130 |
10 | 27068111280 |
11 | 10530274701 |
12 | 52b5080300 |
13 | 2724b3a7c2 |
14 | 144acd2080 |
15 | a8653b1c0 |
hex | 64d6299b0 |
27068111280 has 1280 divisors, whose sum is σ = 120677990400. Its totient is φ = 5434490880.
The previous prime is 27068111261. The next prime is 27068111327. The reversal of 27068111280 is 8211186072.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 342634281 + ... + 342634359.
It is an arithmetic number, because the mean of its divisors is an integer number (94279680).
Almost surely, 227068111280 is an apocalyptic number.
27068111280 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 27068111280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60338995200).
27068111280 is an abundant number, since it is smaller than the sum of its proper divisors (93609879120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27068111280 is a wasteful number, since it uses less digits than its factorization.
27068111280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199 (or 187 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 36.
It can be divided in two parts, 270681 and 11280, that added together give a square (281961 = 5312).
The spelling of 27068111280 in words is "twenty-seven billion, sixty-eight million, one hundred eleven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •