Base | Representation |
---|---|
bin | 1100100111010101001001… |
… | …11110100111110001000001 |
3 | 10122012212221001202211210202 |
4 | 12103222210332213301001 |
5 | 12113441314132124201 |
6 | 134555232115334545 |
7 | 5562060541220522 |
oct | 623524476476101 |
9 | 118185831684722 |
10 | 27739666676801 |
11 | 89253657383a2 |
12 | 31401722b1455 |
13 | 1262abb064291 |
14 | 6bc86d99a849 |
15 | 33188bc31c6b |
hex | 193aa4fa7c41 |
27739666676801 has 2 divisors, whose sum is σ = 27739666676802. Its totient is φ = 27739666676800.
The previous prime is 27739666676767. The next prime is 27739666676803. The reversal of 27739666676801 is 10867666693772.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27297740876176 + 441925800625 = 5224724^2 + 664775^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27739666676801 is a prime.
Together with 27739666676803, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (27739666676803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13869833338400 + 13869833338401.
It is an arithmetic number, because the mean of its divisors is an integer number (13869833338401).
Almost surely, 227739666676801 is an apocalyptic number.
It is an amenable number.
27739666676801 is a deficient number, since it is larger than the sum of its proper divisors (1).
27739666676801 is an equidigital number, since it uses as much as digits as its factorization.
27739666676801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152216576, while the sum is 74.
The spelling of 27739666676801 in words is "twenty-seven trillion, seven hundred thirty-nine billion, six hundred sixty-six million, six hundred seventy-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •