Base | Representation |
---|---|
bin | 11001100110010010… |
… | …101111010111001001 |
3 | 2121221112202002021021 |
4 | 121212102233113021 |
5 | 422242403224033 |
6 | 20343224112441 |
7 | 1662062036416 |
oct | 314622572711 |
9 | 77845662237 |
10 | 27485992393 |
11 | 107251429a2 |
12 | 53b1005721 |
13 | 279059cc32 |
14 | 148a5cd10d |
15 | aad082b2d |
hex | 6664af5c9 |
27485992393 has 2 divisors, whose sum is σ = 27485992394. Its totient is φ = 27485992392.
The previous prime is 27485992367. The next prime is 27485992397. The reversal of 27485992393 is 39329958472.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27308223504 + 177768889 = 165252^2 + 13333^2 .
It is a cyclic number.
It is not a de Polignac number, because 27485992393 - 25 = 27485992361 is a prime.
It is not a weakly prime, because it can be changed into another prime (27485992397) 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 as a sum of consecutive naturals, namely, 13742996196 + 13742996197.
It is an arithmetic number, because the mean of its divisors is an integer number (13742996197).
Almost surely, 227485992393 is an apocalyptic number.
It is an amenable number.
27485992393 is a deficient number, since it is larger than the sum of its proper divisors (1).
27485992393 is an equidigital number, since it uses as much as digits as its factorization.
27485992393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29393280, while the sum is 61.
The spelling of 27485992393 in words is "twenty-seven billion, four hundred eighty-five million, nine hundred ninety-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •