Base | Representation |
---|---|
bin | 11001010010111001… |
… | …000011010010000101 |
3 | 2121002212020220111100 |
4 | 121102321003102011 |
5 | 421111041204031 |
6 | 20251035330313 |
7 | 1651030236240 |
oct | 312271032205 |
9 | 77085226440 |
10 | 27160491141 |
11 | 10578430aa3 |
12 | 531bbb0999 |
13 | 273b013a44 |
14 | 145929c257 |
15 | a8e6d7de6 |
hex | 652e43485 |
27160491141 has 48 divisors (see below), whose sum is σ = 45737602560. Its totient is φ = 15209026560.
The previous prime is 27160491121. The next prime is 27160491191. The reversal of 27160491141 is 14119406172.
27160491141 is a `hidden beast` number, since 2 + 7 + 1 + 604 + 9 + 1 + 1 + 41 = 666.
It is not a de Polignac number, because 27160491141 - 210 = 27160490117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 27160491096 and 27160491105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27160491121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3037365 + ... + 3046293.
It is an arithmetic number, because the mean of its divisors is an integer number (952866720).
Almost surely, 227160491141 is an apocalyptic number.
27160491141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
27160491141 is a deficient number, since it is larger than the sum of its proper divisors (18577111419).
27160491141 is a wasteful number, since it uses less digits than its factorization.
27160491141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9906 (or 9903 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The spelling of 27160491141 in words is "twenty-seven billion, one hundred sixty million, four hundred ninety-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •