Base | Representation |
---|---|
bin | 11001110001111000… |
… | …100101111001000001 |
3 | 2122110002200021210000 |
4 | 121301320211321001 |
5 | 423142144330244 |
6 | 20414412230213 |
7 | 1666643031351 |
oct | 316170457101 |
9 | 78402607700 |
10 | 27680464449 |
11 | 1081499a700 |
12 | 544616b369 |
13 | 27c1970061 |
14 | 14a8372b61 |
15 | ac0199169 |
hex | 671e25e41 |
27680464449 has 60 divisors (see below), whose sum is σ = 45524457748. Its totient is φ = 16748804160.
The previous prime is 27680464411. The next prime is 27680464453. The reversal of 27680464449 is 94446408672.
It can be written as a sum of positive squares in 2 ways, for example, as 27268577424 + 411887025 = 165132^2 + 20295^2 .
It is not a de Polignac number, because 27680464449 - 27 = 27680464321 is a prime.
It is a super-3 number, since 3×276804644493 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 27680464395 and 27680464404.
It is not an unprimeable number, because it can be changed into a prime (27680464349) 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 59 ways as a sum of consecutive naturals, for example, 7182207 + ... + 7186059.
Almost surely, 227680464449 is an apocalyptic number.
It is an amenable number.
27680464449 is a deficient number, since it is larger than the sum of its proper divisors (17843993299).
27680464449 is a wasteful number, since it uses less digits than its factorization.
27680464449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4620 (or 4600 counting only the distinct ones).
The product of its (nonzero) digits is 9289728, while the sum is 54.
The spelling of 27680464449 in words is "twenty-seven billion, six hundred eighty million, four hundred sixty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •