Base | Representation |
---|---|
bin | 1100010011001011110010… |
… | …01011110011100101100001 |
3 | 10112202201011202021222221221 |
4 | 12021211321023303211201 |
5 | 12021121130200412204 |
6 | 133305231242415041 |
7 | 5461053555236533 |
oct | 611457113634541 |
9 | 115681152258857 |
10 | 27047442200929 |
11 | 8688834aa70a7 |
12 | 3049b85801481 |
13 | 12127417936b7 |
14 | 697163209853 |
15 | 31d8755d3654 |
hex | 1899792f3961 |
27047442200929 has 2 divisors, whose sum is σ = 27047442200930. Its totient is φ = 27047442200928.
The previous prime is 27047442200729. The next prime is 27047442200953. The reversal of 27047442200929 is 92900224474072.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13873591224529 + 13173850976400 = 3724727^2 + 3629580^2 .
It is a cyclic number.
It is not a de Polignac number, because 27047442200929 - 231 = 27045294717281 is a prime.
It is a super-2 number, since 2×270474422009292 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (27047442200729) 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, 13523721100464 + 13523721100465.
It is an arithmetic number, because the mean of its divisors is an integer number (13523721100465).
Almost surely, 227047442200929 is an apocalyptic number.
It is an amenable number.
27047442200929 is a deficient number, since it is larger than the sum of its proper divisors (1).
27047442200929 is an equidigital number, since it uses as much as digits as its factorization.
27047442200929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4064256, while the sum is 52.
The spelling of 27047442200929 in words is "twenty-seven trillion, forty-seven billion, four hundred forty-two million, two hundred thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •