Base | Representation |
---|---|
bin | 110010101001011… |
… | …000000011011111 |
3 | 2012012212121012012 |
4 | 302221120003133 |
5 | 3220011112411 |
6 | 220152101435 |
7 | 30025251362 |
oct | 6251300337 |
9 | 2165777165 |
10 | 849707231 |
11 | 3a670168a |
12 | 1b869487b |
13 | 107067c59 |
14 | 80bc80d9 |
15 | 4e8e518b |
hex | 32a580df |
849707231 has 2 divisors, whose sum is σ = 849707232. Its totient is φ = 849707230.
The previous prime is 849707213. The next prime is 849707233. The reversal of 849707231 is 132707948.
849707231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (849707213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 849707231 - 26 = 849707167 is a prime.
It is a super-2 number, since 2×8497072312 = 1444004756827374722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 849707233, 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 (849707233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 424853615 + 424853616.
It is an arithmetic number, because the mean of its divisors is an integer number (424853616).
Almost surely, 2849707231 is an apocalyptic number.
849707231 is a deficient number, since it is larger than the sum of its proper divisors (1).
849707231 is an equidigital number, since it uses as much as digits as its factorization.
849707231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84672, while the sum is 41.
The square root of 849707231 is about 29149.7380948783. The cubic root of 849707231 is about 947.1594675305.
The spelling of 849707231 in words is "eight hundred forty-nine million, seven hundred seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •