Base | Representation |
---|---|
bin | 11001010000100110… |
… | …101111011000100000 |
3 | 2121000012002021222002 |
4 | 121100212233120200 |
5 | 421021231332413 |
6 | 20243145303132 |
7 | 1650053233400 |
oct | 312046573040 |
9 | 77005067862 |
10 | 27122136608 |
11 | 10558814736 |
12 | 530b194aa8 |
13 | 27330a5158 |
14 | 1454156800 |
15 | a8b15d958 |
hex | 6509af620 |
27122136608 has 54 divisors (see below), whose sum is σ = 62129474631. Its totient is φ = 11620977984.
The previous prime is 27122136557. The next prime is 27122136611. The reversal of 27122136608 is 80663122172.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 13561068304 + 13561068304 = 116452^2 + 116452^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=116452.
It is a super-2 number, since 2×271221366082 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6519233 + ... + 6523391.
Almost surely, 227122136608 is an apocalyptic number.
27122136608 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
27122136608 is an abundant number, since it is smaller than the sum of its proper divisors (35007338023).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27122136608 is an frugal number, since it uses more digits than its factorization.
27122136608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8342 (or 4168 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 27122136608 in words is "twenty-seven billion, one hundred twenty-two million, one hundred thirty-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •