Base | Representation |
---|---|
bin | 11001111011011010… |
… | …001110001000111001 |
3 | 2122212020101111122100 |
4 | 121323122032020321 |
5 | 424004102300001 |
6 | 20442321414013 |
7 | 2003623301340 |
oct | 317332161071 |
9 | 78766344570 |
10 | 27840275001 |
11 | 10897122740 |
12 | 548b79a309 |
13 | 2818ac5506 |
14 | 14c1692b57 |
15 | ace215586 |
hex | 67b68e239 |
27840275001 has 24 divisors (see below), whose sum is σ = 50136600384. Its totient is φ = 14462480160.
The previous prime is 27840274999. The next prime is 27840275033. The reversal of 27840275001 is 10057204872.
It is not a de Polignac number, because 27840275001 - 21 = 27840274999 is a prime.
It is a super-4 number, since 4×278402750014 (a number of 43 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (27840275201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20086086 + ... + 20087471.
It is an arithmetic number, because the mean of its divisors is an integer number (2089025016).
Almost surely, 227840275001 is an apocalyptic number.
27840275001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
27840275001 is a deficient number, since it is larger than the sum of its proper divisors (22296325383).
27840275001 is a wasteful number, since it uses less digits than its factorization.
27840275001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40173581 (or 40173578 counting only the distinct ones).
The product of its (nonzero) digits is 31360, while the sum is 36.
Adding to 27840275001 its reverse (10057204872), we get a palindrome (37897479873).
The spelling of 27840275001 in words is "twenty-seven billion, eight hundred forty million, two hundred seventy-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.266 sec. • engine limits •