Base | Representation |
---|---|
bin | 111100110100001… |
… | …101100101110101 |
3 | 2122002220122001222 |
4 | 330310031211311 |
5 | 4042200220432 |
6 | 245125000125 |
7 | 34166402135 |
oct | 7464154565 |
9 | 2562818058 |
10 | 1020320117 |
11 | 483a42673 |
12 | 245853045 |
13 | 13350321b |
14 | 9971aac5 |
15 | 5e897112 |
hex | 3cd0d975 |
1020320117 has 2 divisors, whose sum is σ = 1020320118. Its totient is φ = 1020320116.
The previous prime is 1020320113. The next prime is 1020320131. The reversal of 1020320117 is 7110230201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1013212561 + 7107556 = 31831^2 + 2666^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020320117 - 22 = 1020320113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1020320095 and 1020320104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020320113) 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, 510160058 + 510160059.
It is an arithmetic number, because the mean of its divisors is an integer number (510160059).
Almost surely, 21020320117 is an apocalyptic number.
It is an amenable number.
1020320117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020320117 is an equidigital number, since it uses as much as digits as its factorization.
1020320117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 1020320117 is about 31942.4500782266. The cubic root of 1020320117 is about 1006.7280047684.
Adding to 1020320117 its reverse (7110230201), we get a palindrome (8130550318).
The spelling of 1020320117 in words is "one billion, twenty million, three hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •