Base | Representation |
---|---|
bin | 101000110001… |
… | …111111010001 |
3 | 202010010121221 |
4 | 220301333101 |
5 | 10214044023 |
6 | 1021045041 |
7 | 156603451 |
oct | 50617721 |
9 | 22103557 |
10 | 10690513 |
11 | 6041a39 |
12 | 36b6781 |
13 | 22a3c62 |
14 | 15c3d61 |
15 | e1285d |
hex | a31fd1 |
10690513 has 2 divisors, whose sum is σ = 10690514. Its totient is φ = 10690512.
The previous prime is 10690489. The next prime is 10690529. The reversal of 10690513 is 31509601.
10690513 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6718464 + 3972049 = 2592^2 + 1993^2 .
It is an emirp because it is prime and its reverse (31509601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10690513 is a prime.
It is a super-2 number, since 2×106905132 = 228574136406338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10690583) 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, 5345256 + 5345257.
It is an arithmetic number, because the mean of its divisors is an integer number (5345257).
Almost surely, 210690513 is an apocalyptic number.
It is an amenable number.
10690513 is a deficient number, since it is larger than the sum of its proper divisors (1).
10690513 is an equidigital number, since it uses as much as digits as its factorization.
10690513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 10690513 is about 3269.6349949192. The cubic root of 10690513 is about 220.2924004566.
The spelling of 10690513 in words is "ten million, six hundred ninety thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •