Base | Representation |
---|---|
bin | 1000010010011… |
… | …01000000010101 |
3 | 11211211001110202 |
4 | 10021031000111 |
5 | 120244141204 |
6 | 10522030245 |
7 | 1502631245 |
oct | 411150025 |
9 | 154731422 |
10 | 69521429 |
11 | 3627452a |
12 | 1b348385 |
13 | 11531a53 |
14 | 9339b25 |
15 | 6183e1e |
hex | 424d015 |
69521429 has 2 divisors, whose sum is σ = 69521430. Its totient is φ = 69521428.
The previous prime is 69521407. The next prime is 69521443. The reversal of 69521429 is 92412596.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64368529 + 5152900 = 8023^2 + 2270^2 .
It is a cyclic number.
It is not a de Polignac number, because 69521429 - 28 = 69521173 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 69521392 and 69521401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69521489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34760714 + 34760715.
It is an arithmetic number, because the mean of its divisors is an integer number (34760715).
Almost surely, 269521429 is an apocalyptic number.
It is an amenable number.
69521429 is a deficient number, since it is larger than the sum of its proper divisors (1).
69521429 is an equidigital number, since it uses as much as digits as its factorization.
69521429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 38880, while the sum is 38.
The square root of 69521429 is about 8337.9511272254. The cubic root of 69521429 is about 411.1871778220.
The spelling of 69521429 in words is "sixty-nine million, five hundred twenty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •