Base | Representation |
---|---|
bin | 11001100011010111… |
… | …110001100101010001 |
3 | 2121211010112000200020 |
4 | 121203113301211101 |
5 | 422142331334221 |
6 | 20334313414053 |
7 | 1660625325654 |
oct | 314327614521 |
9 | 77733460606 |
10 | 27436980561 |
11 | 106aa507651 |
12 | 539870a329 |
13 | 278339c553 |
14 | 1483cb189b |
15 | aa8b00ac6 |
hex | 6635f1951 |
27436980561 has 24 divisors (see below), whose sum is σ = 39058652160. Its totient is φ = 17127866112.
The previous prime is 27436980523. The next prime is 27436980563. The reversal of 27436980561 is 16508963472.
It is not a de Polignac number, because 27436980561 - 27 = 27436980433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (27436980563) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 90480 + ... + 251118.
It is an arithmetic number, because the mean of its divisors is an integer number (1627443840).
It is a 1-persistent number, because it is pandigital, but 2⋅27436980561 = 54873961122 is not.
Almost surely, 227436980561 is an apocalyptic number.
It is an amenable number.
27436980561 is a deficient number, since it is larger than the sum of its proper divisors (11621671599).
27436980561 is a wasteful number, since it uses less digits than its factorization.
27436980561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160873 (or 160856 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 27436980561 in words is "twenty-seven billion, four hundred thirty-six million, nine hundred eighty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •