Base | Representation |
---|---|
bin | 1000001110100… |
… | …01110100011101 |
3 | 11210212102100001 |
4 | 10013101310131 |
5 | 120132014421 |
6 | 10503134301 |
7 | 1465430224 |
oct | 407216435 |
9 | 153772301 |
10 | 69016861 |
11 | 35a5a431 |
12 | 1b144391 |
13 | 113b61a4 |
14 | 9247cbb |
15 | 60d4691 |
hex | 41d1d1d |
69016861 has 2 divisors, whose sum is σ = 69016862. Its totient is φ = 69016860.
The previous prime is 69016841. The next prime is 69016879. The reversal of 69016861 is 16861096.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68989636 + 27225 = 8306^2 + 165^2 .
It is a cyclic number.
It is not a de Polignac number, because 69016861 - 27 = 69016733 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 69016861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69016811) 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, 34508430 + 34508431.
It is an arithmetic number, because the mean of its divisors is an integer number (34508431).
Almost surely, 269016861 is an apocalyptic number.
It is an amenable number.
69016861 is a deficient number, since it is larger than the sum of its proper divisors (1).
69016861 is an equidigital number, since it uses as much as digits as its factorization.
69016861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 37.
The square root of 69016861 is about 8307.6387138585. The cubic root of 69016861 is about 410.1899991880.
The spelling of 69016861 in words is "sixty-nine million, sixteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •