Base | Representation |
---|---|
bin | 111100110011011… |
… | …011000110100101 |
3 | 2122002112010101201 |
4 | 330303123012211 |
5 | 4042122111232 |
6 | 245120322501 |
7 | 34164551206 |
oct | 7463330645 |
9 | 2562463351 |
10 | 1020113317 |
11 | 483911263 |
12 | 245773431 |
13 | 133460062 |
14 | 996a55ad |
15 | 5e855be7 |
hex | 3ccdb1a5 |
1020113317 has 2 divisors, whose sum is σ = 1020113318. Its totient is φ = 1020113316.
The previous prime is 1020113299. The next prime is 1020113323. The reversal of 1020113317 is 7133110201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 993888676 + 26224641 = 31526^2 + 5121^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020113317 - 223 = 1011724709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1020113294 and 1020113303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020123317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510056658 + 510056659.
It is an arithmetic number, because the mean of its divisors is an integer number (510056659).
Almost surely, 21020113317 is an apocalyptic number.
It is an amenable number.
1020113317 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020113317 is an equidigital number, since it uses as much as digits as its factorization.
1020113317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 19.
The square root of 1020113317 is about 31939.2128425232. The cubic root of 1020113317 is about 1006.6599851293.
Adding to 1020113317 its reverse (7133110201), we get a palindrome (8153223518).
The spelling of 1020113317 in words is "one billion, twenty million, one hundred thirteen thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •