Base | Representation |
---|---|
bin | 10011111101100100… |
… | …01111111111110001 |
3 | 1000122212222212022212 |
4 | 21332302033333301 |
5 | 133422030132104 |
6 | 4531235141505 |
7 | 526402210313 |
oct | 117662177761 |
9 | 30585885285 |
10 | 10717036529 |
11 | 45aa540191 |
12 | 20b1144895 |
13 | 101a413144 |
14 | 7394937b3 |
15 | 42ace836e |
hex | 27ec8fff1 |
10717036529 has 2 divisors, whose sum is σ = 10717036530. Its totient is φ = 10717036528.
The previous prime is 10717036513. The next prime is 10717036531. The reversal of 10717036529 is 92563071701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10633734400 + 83302129 = 103120^2 + 9127^2 .
It is an emirp because it is prime and its reverse (92563071701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10717036529 - 24 = 10717036513 is a prime.
It is a super-2 number, since 2×107170365292 (a number of 21 digits) contains 22 as substring.
Together with 10717036531, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10717036559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5358518264 + 5358518265.
It is an arithmetic number, because the mean of its divisors is an integer number (5358518265).
Almost surely, 210717036529 is an apocalyptic number.
It is an amenable number.
10717036529 is a deficient number, since it is larger than the sum of its proper divisors (1).
10717036529 is an equidigital number, since it uses as much as digits as its factorization.
10717036529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79380, while the sum is 41.
The spelling of 10717036529 in words is "ten billion, seven hundred seventeen million, thirty-six thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •