Base | Representation |
---|---|
bin | 1000010000110… |
… | …01110011100001 |
3 | 11211102101210111 |
4 | 10020121303201 |
5 | 120220433323 |
6 | 10513331321 |
7 | 1501065652 |
oct | 410316341 |
9 | 154371714 |
10 | 69311713 |
11 | 36140a09 |
12 | 1b266b41 |
13 | 1148a463 |
14 | 92c3529 |
15 | 6141c0d |
hex | 4219ce1 |
69311713 has 2 divisors, whose sum is σ = 69311714. Its totient is φ = 69311712.
The previous prime is 69311633. The next prime is 69311717. The reversal of 69311713 is 31711396.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67371264 + 1940449 = 8208^2 + 1393^2 .
It is a cyclic number.
It is not a de Polignac number, because 69311713 - 217 = 69180641 is a prime.
It is a super-2 number, since 2×693117132 = 9608227117988738, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (69311717) 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, 34655856 + 34655857.
It is an arithmetic number, because the mean of its divisors is an integer number (34655857).
Almost surely, 269311713 is an apocalyptic number.
It is an amenable number.
69311713 is a deficient number, since it is larger than the sum of its proper divisors (1).
69311713 is an equidigital number, since it uses as much as digits as its factorization.
69311713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3402, while the sum is 31.
The square root of 69311713 is about 8325.3656376162. The cubic root of 69311713 is about 410.7733035881.
The spelling of 69311713 in words is "sixty-nine million, three hundred eleven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •