Base | Representation |
---|---|
bin | 11001011010011111… |
… | …101101100110110001 |
3 | 2121102202022101221221 |
4 | 121122133231212301 |
5 | 421341221111411 |
6 | 20311433545041 |
7 | 1654136511064 |
oct | 313237554661 |
9 | 77382271857 |
10 | 27288066481 |
11 | 10633447265 |
12 | 5356875181 |
13 | 275b590a00 |
14 | 146c1ca8db |
15 | a9a9d8071 |
hex | 65a7ed9b1 |
27288066481 has 27 divisors (see below), whose sum is σ = 30086032833. Its totient is φ = 24739004160.
The previous prime is 27288066451. The next prime is 27288066497. The reversal of 27288066481 is 18466088272.
It is a happy number.
The square root of 27288066481 is 165191.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 4985630881 + 22302435600 = 70609^2 + 149340^2 .
It is not a de Polignac number, because 27288066481 - 29 = 27288065969 is a prime.
It is a super-2 number, since 2×272880664812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27288066431) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 208305786 + ... + 208305916.
Almost surely, 227288066481 is an apocalyptic number.
27288066481 is the 165191-st square number.
27288066481 is the 82596-th centered octagonal number.
It is an amenable number.
27288066481 is a deficient number, since it is larger than the sum of its proper divisors (2797966352).
27288066481 is an frugal number, since it uses more digits than its factorization.
27288066481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482 (or 241 counting only the distinct ones).
The product of its (nonzero) digits is 2064384, while the sum is 52.
The spelling of 27288066481 in words is "twenty-seven billion, two hundred eighty-eight million, sixty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •