Base | Representation |
---|---|
bin | 1000010001100… |
… | …00100110111001 |
3 | 11211121010220202 |
4 | 10020300212321 |
5 | 120231430423 |
6 | 10515331545 |
7 | 1501635161 |
oct | 410604671 |
9 | 154533822 |
10 | 69405113 |
11 | 361a50a8 |
12 | 1b2b0bb5 |
13 | 114c0b1b |
14 | 93095a1 |
15 | 615e728 |
hex | 42309b9 |
69405113 has 2 divisors, whose sum is σ = 69405114. Its totient is φ = 69405112.
The previous prime is 69405107. The next prime is 69405131. The reversal of 69405113 is 31150496.
Together with next prime (69405131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57350329 + 12054784 = 7573^2 + 3472^2 .
It is a cyclic number.
It is not a de Polignac number, because 69405113 - 24 = 69405097 is a prime.
It is a super-3 number, since 3×694051133 (a number of 25 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (69405013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34702556 + 34702557.
It is an arithmetic number, because the mean of its divisors is an integer number (34702557).
Almost surely, 269405113 is an apocalyptic number.
It is an amenable number.
69405113 is a deficient number, since it is larger than the sum of its proper divisors (1).
69405113 is an equidigital number, since it uses as much as digits as its factorization.
69405113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 69405113 is about 8330.9731124281. The cubic root of 69405113 is about 410.9577313205.
The spelling of 69405113 in words is "sixty-nine million, four hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •