Base | Representation |
---|---|
bin | 110000011101011… |
… | …010010010100111 |
3 | 2002122211111121021 |
4 | 300131122102213 |
5 | 3131113004411 |
6 | 212401432011 |
7 | 26101344466 |
oct | 6035322247 |
9 | 2078744537 |
10 | 813016231 |
11 | 387a21145 |
12 | 1a833b607 |
13 | cc58c5c1 |
14 | 79d969dd |
15 | 4b598a71 |
hex | 3075a4a7 |
813016231 has 2 divisors, whose sum is σ = 813016232. Its totient is φ = 813016230.
The previous prime is 813016229. The next prime is 813016241. The reversal of 813016231 is 132610318.
813016231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 813016231 - 21 = 813016229 is a prime.
It is a super-2 number, since 2×8130162312 = 1321990783738890722, which contains 22 as substring.
Together with 813016229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 813016196 and 813016205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (813016241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 406508115 + 406508116.
It is an arithmetic number, because the mean of its divisors is an integer number (406508116).
Almost surely, 2813016231 is an apocalyptic number.
813016231 is a deficient number, since it is larger than the sum of its proper divisors (1).
813016231 is an equidigital number, since it uses as much as digits as its factorization.
813016231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 813016231 is about 28513.4394803573. The cubic root of 813016231 is about 933.3253717717.
Adding to 813016231 its reverse (132610318), we get a palindrome (945626549).
The spelling of 813016231 in words is "eight hundred thirteen million, sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •