Base | Representation |
---|---|
bin | 11001010000011101… |
… | …001001110000000001 |
3 | 2121000000100121011202 |
4 | 121100131021300001 |
5 | 421020110420134 |
6 | 20243015350545 |
7 | 1650022664522 |
oct | 312035116001 |
9 | 77000317152 |
10 | 27119623169 |
11 | 10557358311 |
12 | 530a382455 |
13 | 2732705102 |
14 | 1453aa0849 |
15 | a8ad13d7e |
hex | 650749c01 |
27119623169 has 2 divisors, whose sum is σ = 27119623170. Its totient is φ = 27119623168.
The previous prime is 27119623117. The next prime is 27119623171. The reversal of 27119623169 is 96132691172.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24795226225 + 2324396944 = 157465^2 + 48212^2 .
It is a cyclic number.
It is not a de Polignac number, because 27119623169 - 224 = 27102845953 is a prime.
It is a super-2 number, since 2×271196231692 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 27119623171, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (27119623199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13559811584 + 13559811585.
It is an arithmetic number, because the mean of its divisors is an integer number (13559811585).
Almost surely, 227119623169 is an apocalyptic number.
It is an amenable number.
27119623169 is a deficient number, since it is larger than the sum of its proper divisors (1).
27119623169 is an equidigital number, since it uses as much as digits as its factorization.
27119623169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 244944, while the sum is 47.
The spelling of 27119623169 in words is "twenty-seven billion, one hundred nineteen million, six hundred twenty-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •