Base | Representation |
---|---|
bin | 11001101111100010… |
… | …010100110110101111 |
3 | 2122100100112222222002 |
4 | 121233202110312233 |
5 | 423102103314241 |
6 | 20410444042515 |
7 | 1665654146603 |
oct | 315742246657 |
9 | 78310488862 |
10 | 27641073071 |
11 | 107a4735347 |
12 | 5434b3343b |
13 | 27b675a551 |
14 | 14a303b503 |
15 | abb9b789b |
hex | 66f894daf |
27641073071 has 2 divisors, whose sum is σ = 27641073072. Its totient is φ = 27641073070.
The previous prime is 27641073059. The next prime is 27641073107. The reversal of 27641073071 is 17037014672.
Together with next prime (27641073107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 27641073071 - 218 = 27640810927 is a prime.
It is a super-2 number, since 2×276410730712 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27641073001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13820536535 + 13820536536.
It is an arithmetic number, because the mean of its divisors is an integer number (13820536536).
Almost surely, 227641073071 is an apocalyptic number.
27641073071 is a deficient number, since it is larger than the sum of its proper divisors (1).
27641073071 is an equidigital number, since it uses as much as digits as its factorization.
27641073071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49392, while the sum is 38.
The spelling of 27641073071 in words is "twenty-seven billion, six hundred forty-one million, seventy-three thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •