Base | Representation |
---|---|
bin | 11010111110111000111… |
… | …10011000010110100101 |
3 | 10021122001101001100200012 |
4 | 31133130132120112211 |
5 | 110142213412421404 |
6 | 1545524525100005 |
7 | 123660551540003 |
oct | 15373436302645 |
9 | 3248041040605 |
10 | 927116920229 |
11 | 328208371375 |
12 | 12b8216b7605 |
13 | 69571755b36 |
14 | 32c30981a73 |
15 | 191b2ea9a6e |
hex | d7dc7985a5 |
927116920229 has 2 divisors, whose sum is σ = 927116920230. Its totient is φ = 927116920228.
The previous prime is 927116920133. The next prime is 927116920231. The reversal of 927116920229 is 922029611729.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 732433007329 + 194683912900 = 855823^2 + 441230^2 .
It is an emirp because it is prime and its reverse (922029611729) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 927116920229 - 212 = 927116916133 is a prime.
Together with 927116920231, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (927116220229) 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, 463558460114 + 463558460115.
It is an arithmetic number, because the mean of its divisors is an integer number (463558460115).
Almost surely, 2927116920229 is an apocalyptic number.
It is an amenable number.
927116920229 is a deficient number, since it is larger than the sum of its proper divisors (1).
927116920229 is an equidigital number, since it uses as much as digits as its factorization.
927116920229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 489888, while the sum is 50.
The spelling of 927116920229 in words is "nine hundred twenty-seven billion, one hundred sixteen million, nine hundred twenty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •