Base | Representation |
---|---|
bin | 110110111010100… |
… | …101011000100001 |
3 | 2101012122021020022 |
4 | 312322211120201 |
5 | 3341324432022 |
6 | 231231123225 |
7 | 31555102643 |
oct | 6672453041 |
9 | 2335567208 |
10 | 921327137 |
11 | 433079795 |
12 | 218673515 |
13 | 118b52bb3 |
14 | 8a50c893 |
15 | 55d40c42 |
hex | 36ea5621 |
921327137 has 2 divisors, whose sum is σ = 921327138. Its totient is φ = 921327136.
The previous prime is 921327133. The next prime is 921327139. The reversal of 921327137 is 731723129.
921327137 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 can be written as a sum of positive squares in only one way, i.e., 684136336 + 237190801 = 26156^2 + 15401^2 .
It is a cyclic number.
It is not a de Polignac number, because 921327137 - 22 = 921327133 is a prime.
Together with 921327139, 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 = 921327097 and 921327106.
It is not a weakly prime, because it can be changed into another prime (921327133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 460663568 + 460663569.
It is an arithmetic number, because the mean of its divisors is an integer number (460663569).
Almost surely, 2921327137 is an apocalyptic number.
It is an amenable number.
921327137 is a deficient number, since it is larger than the sum of its proper divisors (1).
921327137 is an equidigital number, since it uses as much as digits as its factorization.
921327137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15876, while the sum is 35.
The square root of 921327137 is about 30353.3710977875. The cubic root of 921327137 is about 973.0562676888.
The spelling of 921327137 in words is "nine hundred twenty-one million, three hundred twenty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •