Base | Representation |
---|---|
bin | 11101011111000011010… |
… | …10011011010110001001 |
3 | 10120211222220121112220212 |
4 | 32233201222123112021 |
5 | 113044313421411332 |
6 | 2053225131530505 |
7 | 133123434023435 |
oct | 16574152332611 |
9 | 3524886545825 |
10 | 1013103310217 |
11 | 360722452899 |
12 | 14441a2b9a35 |
13 | 746c5b9c93b |
14 | 3706a7c59c5 |
15 | 1b546cc38b2 |
hex | ebe1a9b589 |
1013103310217 has 2 divisors, whose sum is σ = 1013103310218. Its totient is φ = 1013103310216.
The previous prime is 1013103310199. The next prime is 1013103310223. The reversal of 1013103310217 is 7120133013101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 576097698121 + 437005612096 = 759011^2 + 661064^2 .
It is an emirp because it is prime and its reverse (7120133013101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1013103310217 - 210 = 1013103309193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013103310192 and 1013103310201.
It is not a weakly prime, because it can be changed into another prime (1013103310277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506551655108 + 506551655109.
It is an arithmetic number, because the mean of its divisors is an integer number (506551655109).
Almost surely, 21013103310217 is an apocalyptic number.
It is an amenable number.
1013103310217 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013103310217 is an equidigital number, since it uses as much as digits as its factorization.
1013103310217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 378, while the sum is 23.
Adding to 1013103310217 its reverse (7120133013101), we get a palindrome (8133236323318).
The spelling of 1013103310217 in words is "one trillion, thirteen billion, one hundred three million, three hundred ten thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •