Base | Representation |
---|---|
bin | 1000010000000… |
… | …10001111111111 |
3 | 11211020111110002 |
4 | 10020002033333 |
5 | 120204341411 |
6 | 10511304515 |
7 | 1500214451 |
oct | 410021777 |
9 | 154214402 |
10 | 69215231 |
11 | 36085478 |
12 | 1b21b13b |
13 | 11455577 |
14 | 929a2d1 |
15 | 612333b |
hex | 42023ff |
69215231 has 2 divisors, whose sum is σ = 69215232. Its totient is φ = 69215230.
The previous prime is 69215207. The next prime is 69215239. The reversal of 69215231 is 13251296.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 69215231 - 222 = 65020927 is a prime.
It is a super-2 number, since 2×692152312 = 9581496404766722, which contains 22 as substring.
It is a plaindrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 69215194 and 69215203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69215239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34607615 + 34607616.
It is an arithmetic number, because the mean of its divisors is an integer number (34607616).
Almost surely, 269215231 is an apocalyptic number.
69215231 is a deficient number, since it is larger than the sum of its proper divisors (1).
69215231 is an equidigital number, since it uses as much as digits as its factorization.
69215231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3240, while the sum is 29.
The square root of 69215231 is about 8319.5691595178. The cubic root of 69215231 is about 410.5826160801.
The spelling of 69215231 in words is "sixty-nine million, two hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •