Base | Representation |
---|---|
bin | 110110110101111… |
… | …000000010111101 |
3 | 2101010022120010101 |
4 | 312311320002331 |
5 | 3341020432421 |
6 | 231144441101 |
7 | 31541442322 |
oct | 6665700275 |
9 | 2333276111 |
10 | 920092861 |
11 | 432406426 |
12 | 218179191 |
13 | 11881015c |
14 | 8a2aab49 |
15 | 55b9a191 |
hex | 36d780bd |
920092861 has 2 divisors, whose sum is σ = 920092862. Its totient is φ = 920092860.
The previous prime is 920092813. The next prime is 920092867. The reversal of 920092861 is 168290029.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 761484025 + 158608836 = 27595^2 + 12594^2 .
It is an emirp because it is prime and its reverse (168290029) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-920092861 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 920092861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (920092867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 460046430 + 460046431.
It is an arithmetic number, because the mean of its divisors is an integer number (460046431).
Almost surely, 2920092861 is an apocalyptic number.
It is an amenable number.
920092861 is a deficient number, since it is larger than the sum of its proper divisors (1).
920092861 is an equidigital number, since it uses as much as digits as its factorization.
920092861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 37.
The square root of 920092861 is about 30333.0325058343. The cubic root of 920092861 is about 972.6215481509.
The spelling of 920092861 in words is "nine hundred twenty million, ninety-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •