Base | Representation |
---|---|
bin | 11001100001101001… |
… | …111101111001000101 |
3 | 2121202010100120111120 |
4 | 121201221331321011 |
5 | 422112444221031 |
6 | 20331404424153 |
7 | 1660125546315 |
oct | 314151757105 |
9 | 77663316446 |
10 | 27408195141 |
11 | 10695236748 |
12 | 538ab48059 |
13 | 277a431362 |
14 | 148013b445 |
15 | aa6316a96 |
hex | 661a7de45 |
27408195141 has 64 divisors (see below), whose sum is σ = 40309125120. Its totient is φ = 16496363520.
The previous prime is 27408195131. The next prime is 27408195149. The reversal of 27408195141 is 14159180472.
It is not a de Polignac number, because 27408195141 - 25 = 27408195109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 27408195093 and 27408195102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27408195149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 48682126 + ... + 48682688.
It is an arithmetic number, because the mean of its divisors is an integer number (629830080).
Almost surely, 227408195141 is an apocalyptic number.
It is an amenable number.
27408195141 is a deficient number, since it is larger than the sum of its proper divisors (12900929979).
27408195141 is a wasteful number, since it uses less digits than its factorization.
27408195141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986.
The product of its (nonzero) digits is 80640, while the sum is 42.
The spelling of 27408195141 in words is "twenty-seven billion, four hundred eight million, one hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •