Base | Representation |
---|---|
bin | 11001001100010001… |
… | …100110010111010101 |
3 | 2120211010101020202201 |
4 | 121030101212113111 |
5 | 420344132021111 |
6 | 20232032204501 |
7 | 1645211556403 |
oct | 311421462725 |
9 | 76733336681 |
10 | 27049485781 |
11 | 1052080302a |
12 | 52aa999731 |
13 | 2721018bb6 |
14 | 1448644473 |
15 | a84aac6c1 |
hex | 64c4665d5 |
27049485781 has 8 divisors (see below), whose sum is σ = 27997222680. Its totient is φ = 26102748672.
The previous prime is 27049485739. The next prime is 27049485797. The reversal of 27049485781 is 18758494072.
It can be written as a sum of positive squares in 4 ways, for example, as 1819022500 + 25230463281 = 42650^2 + 158841^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 27049485781 - 211 = 27049483733 is a prime.
It is a super-2 number, since 2×270494857812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27049480781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 194680 + ... + 303313.
It is an arithmetic number, because the mean of its divisors is an integer number (3499652835).
Almost surely, 227049485781 is an apocalyptic number.
It is an amenable number.
27049485781 is a deficient number, since it is larger than the sum of its proper divisors (947736899).
27049485781 is a wasteful number, since it uses less digits than its factorization.
27049485781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499895.
The product of its (nonzero) digits is 4515840, while the sum is 55.
The spelling of 27049485781 in words is "twenty-seven billion, forty-nine million, four hundred eighty-five thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •