Base | Representation |
---|---|
bin | 110011110110000… |
… | …001110010110001 |
3 | 2020121200110211221 |
4 | 303312001302301 |
5 | 3240132114022 |
6 | 222150505041 |
7 | 30361121242 |
oct | 6366016261 |
9 | 2217613757 |
10 | 869801137 |
11 | 406a86517 |
12 | 203365181 |
13 | 10b28203a |
14 | 83738cc9 |
15 | 51563cc7 |
hex | 33d81cb1 |
869801137 has 2 divisors, whose sum is σ = 869801138. Its totient is φ = 869801136.
The previous prime is 869801063. The next prime is 869801173. The reversal of 869801137 is 731108968.
869801137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (869801173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 806503201 + 63297936 = 28399^2 + 7956^2 .
It is a cyclic number.
It is not a de Polignac number, because 869801137 - 223 = 861412529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 869801093 and 869801102.
It is not a weakly prime, because it can be changed into another prime (869801197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 434900568 + 434900569.
It is an arithmetic number, because the mean of its divisors is an integer number (434900569).
Almost surely, 2869801137 is an apocalyptic number.
It is an amenable number.
869801137 is a deficient number, since it is larger than the sum of its proper divisors (1).
869801137 is an equidigital number, since it uses as much as digits as its factorization.
869801137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 43.
The square root of 869801137 is about 29492.3911712835. The cubic root of 869801137 is about 954.5675287541.
The spelling of 869801137 in words is "eight hundred sixty-nine million, eight hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •