Base | Representation |
---|---|
bin | 1001101111000001000101… |
… | …0010101101001001011001 |
3 | 1101220020012202202001122102 |
4 | 2123300101102231021121 |
5 | 2400330424221232232 |
6 | 34433014522533145 |
7 | 2153201646063062 |
oct | 233602122551131 |
9 | 41806182661572 |
10 | 10703348617817 |
11 | 34572a0293859 |
12 | 124a4699671b5 |
13 | 5c842429aa0b |
14 | 29008b067569 |
15 | 138642ea3662 |
hex | 9bc114ad259 |
10703348617817 has 2 divisors, whose sum is σ = 10703348617818. Its totient is φ = 10703348617816.
The previous prime is 10703348617721. The next prime is 10703348617847. The reversal of 10703348617817 is 71871684330701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8766697861321 + 1936650756496 = 2960861^2 + 1391636^2 .
It is an emirp because it is prime and its reverse (71871684330701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10703348617817 - 212 = 10703348613721 is a prime.
It is a super-2 number, since 2×107033486178172 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10703348617847) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5351674308908 + 5351674308909.
It is an arithmetic number, because the mean of its divisors is an integer number (5351674308909).
Almost surely, 210703348617817 is an apocalyptic number.
It is an amenable number.
10703348617817 is a deficient number, since it is larger than the sum of its proper divisors (1).
10703348617817 is an equidigital number, since it uses as much as digits as its factorization.
10703348617817 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4741632, while the sum is 56.
The spelling of 10703348617817 in words is "ten trillion, seven hundred three billion, three hundred forty-eight million, six hundred seventeen thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •