Base | Representation |
---|---|
bin | 101000101100… |
… | …110111001001 |
3 | 202002001211011 |
4 | 220230313021 |
5 | 10212411023 |
6 | 1020403521 |
7 | 156455311 |
oct | 50546711 |
9 | 22061734 |
10 | 10669513 |
11 | 6028188 |
12 | 36a65a1 |
13 | 229752a |
14 | 15ba441 |
15 | e0b50d |
hex | a2cdc9 |
10669513 has 2 divisors, whose sum is σ = 10669514. Its totient is φ = 10669512.
The previous prime is 10669511. The next prime is 10669531. The reversal of 10669513 is 31596601.
10669513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (10669531) 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., 9653449 + 1016064 = 3107^2 + 1008^2 .
It is a cyclic number.
It is not a de Polignac number, because 10669513 - 21 = 10669511 is a prime.
It is a super-2 number, since 2×106695132 = 227677015314338, which contains 22 as substring.
Together with 10669511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10669511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5334756 + 5334757.
It is an arithmetic number, because the mean of its divisors is an integer number (5334757).
Almost surely, 210669513 is an apocalyptic number.
It is an amenable number.
10669513 is a deficient number, since it is larger than the sum of its proper divisors (1).
10669513 is an equidigital number, since it uses as much as digits as its factorization.
10669513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 10669513 is about 3266.4220486643. The cubic root of 10669513 is about 220.1480614883.
The spelling of 10669513 in words is "ten million, six hundred sixty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •