Base | Representation |
---|---|
bin | 11001111001011111… |
… | …101111000100001101 |
3 | 2122202222222012120220 |
4 | 121321133233010031 |
5 | 423422342304112 |
6 | 20435213301553 |
7 | 2003053340502 |
oct | 317137570415 |
9 | 78688865526 |
10 | 27808166157 |
11 | 1087aa91902 |
12 | 5480a948b9 |
13 | 28122626b5 |
14 | 14bb2d54a9 |
15 | acb4c198c |
hex | 6797ef10d |
27808166157 has 8 divisors (see below), whose sum is σ = 37129853280. Its totient is φ = 18512628240.
The previous prime is 27808166153. The next prime is 27808166161. The reversal of 27808166157 is 75166180872.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (27808166153) and next prime (27808166161).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 27808166157 - 22 = 27808166153 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27808166153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6534819 + ... + 6539072.
It is an arithmetic number, because the mean of its divisors is an integer number (4641231660).
Almost surely, 227808166157 is an apocalyptic number.
It is an amenable number.
27808166157 is a deficient number, since it is larger than the sum of its proper divisors (9321687123).
27808166157 is a wasteful number, since it uses less digits than its factorization.
27808166157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13074603.
The product of its (nonzero) digits is 1128960, while the sum is 51.
The spelling of 27808166157 in words is "twenty-seven billion, eight hundred eight million, one hundred sixty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •