Base | Representation |
---|---|
bin | 11001001101100100… |
… | …101010011101101000 |
3 | 2120212122100112002112 |
4 | 121031210222131220 |
5 | 420420220314040 |
6 | 20234131021452 |
7 | 1645564626533 |
oct | 311544523550 |
9 | 76778315075 |
10 | 27071260520 |
11 | 10532025787 |
12 | 52b613a888 |
13 | 27256a1065 |
14 | 144b4b1a1a |
15 | a8695e365 |
hex | 64d92a768 |
27071260520 has 64 divisors (see below), whose sum is σ = 61718690880. Its totient is φ = 10685454336.
The previous prime is 27071260519. The next prime is 27071260523. The reversal of 27071260520 is 2506217072.
It is a super-2 number, since 2×270712605202 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (27071260523) 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 15 ways as a sum of consecutive naturals, for example, 1336307 + ... + 1356413.
It is an arithmetic number, because the mean of its divisors is an integer number (964354545).
Almost surely, 227071260520 is an apocalyptic number.
27071260520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27071260520 is an abundant number, since it is smaller than the sum of its proper divisors (34647430360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27071260520 is a wasteful number, since it uses less digits than its factorization.
27071260520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20562 (or 20558 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 32.
Adding to 27071260520 its reverse (2506217072), we get a palindrome (29577477592).
The spelling of 27071260520 in words is "twenty-seven billion, seventy-one million, two hundred sixty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •