Base | Representation |
---|---|
bin | 1100100000000110010010… |
… | …10100010111100111101000 |
3 | 10121100010111210011000222010 |
4 | 12100003021110113213220 |
5 | 12100403403033120230 |
6 | 134245133543555520 |
7 | 5535112530406242 |
oct | 620031124274750 |
9 | 117303453130863 |
10 | 27491168254440 |
11 | 8839a36871700 |
12 | 30bbb8075bba0 |
13 | 12455380ca787 |
14 | 6b081877d092 |
15 | 32a195b749b0 |
hex | 1900c95179e8 |
27491168254440 has 96 divisors (see below), whose sum is σ = 90652695366240. Its totient is φ = 6664525633920.
The previous prime is 27491168254391. The next prime is 27491168254447. The reversal of 27491168254440 is 4445286119472.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (27491168254447) 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 23 ways as a sum of consecutive naturals, for example, 946651054 + ... + 946680093.
It is an arithmetic number, because the mean of its divisors is an integer number (944298910065).
Almost surely, 227491168254440 is an apocalyptic number.
27491168254440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27491168254440 is an abundant number, since it is smaller than the sum of its proper divisors (63161527111800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27491168254440 is a wasteful number, since it uses less digits than its factorization.
27491168254440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1893331183 (or 1893331168 counting only the distinct ones).
The product of its (nonzero) digits is 15482880, while the sum is 57.
The spelling of 27491168254440 in words is "twenty-seven trillion, four hundred ninety-one billion, one hundred sixty-eight million, two hundred fifty-four thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •