Base | Representation |
---|---|
bin | 11001011000001101… |
… | …110000100010000001 |
3 | 2121100002022112200101 |
4 | 121120031300202001 |
5 | 421301422233231 |
6 | 20303545522401 |
7 | 1653163344625 |
oct | 313015604201 |
9 | 77302275611 |
10 | 27249805441 |
11 | 10613894171 |
12 | 5345aa3401 |
13 | 2753685841 |
14 | 14670ab185 |
15 | a9747b661 |
hex | 658370881 |
27249805441 has 4 divisors (see below), whose sum is σ = 27914434884. Its totient is φ = 26585176000.
The previous prime is 27249805423. The next prime is 27249805481. The reversal of 27249805441 is 14450894272.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 334121841 + 26915683600 = 18279^2 + 164060^2 .
It is a cyclic number.
It is not a de Polignac number, because 27249805441 - 215 = 27249772673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27249805391 and 27249805400.
It is not an unprimeable number, because it can be changed into a prime (27249805481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 332314660 + ... + 332314741.
It is an arithmetic number, because the mean of its divisors is an integer number (6978608721).
Almost surely, 227249805441 is an apocalyptic number.
It is an amenable number.
27249805441 is a deficient number, since it is larger than the sum of its proper divisors (664629443).
27249805441 is an equidigital number, since it uses as much as digits as its factorization.
27249805441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664629442.
The product of its (nonzero) digits is 645120, while the sum is 46.
The spelling of 27249805441 in words is "twenty-seven billion, two hundred forty-nine million, eight hundred five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •