Base | Representation |
---|---|
bin | 10000100111100111… |
… | …11100100100100011 |
3 | 212000210220202220102 |
4 | 20103303330210203 |
5 | 121233103203024 |
6 | 4033204133015 |
7 | 434050314146 |
oct | 102363744443 |
9 | 25023822812 |
10 | 8922319139 |
11 | 3869464478 |
12 | 189009716b |
13 | ac26526a6 |
14 | 608d9405d |
15 | 3734851ae |
hex | 213cfc923 |
8922319139 has 2 divisors, whose sum is σ = 8922319140. Its totient is φ = 8922319138.
The previous prime is 8922319123. The next prime is 8922319141. The reversal of 8922319139 is 9319132298.
8922319139 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 8922319139 - 24 = 8922319123 is a prime.
Together with 8922319141, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 8922319093 and 8922319102.
It is not a weakly prime, because it can be changed into another prime (8922319639) 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, 4461159569 + 4461159570.
It is an arithmetic number, because the mean of its divisors is an integer number (4461159570).
Almost surely, 28922319139 is an apocalyptic number.
8922319139 is a deficient number, since it is larger than the sum of its proper divisors (1).
8922319139 is an equidigital number, since it uses as much as digits as its factorization.
8922319139 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 209952, while the sum is 47.
The square root of 8922319139 is about 94458.0284517944. The cubic root of 8922319139 is about 2074.0819775340.
The spelling of 8922319139 in words is "eight billion, nine hundred twenty-two million, three hundred nineteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •