Base | Representation |
---|---|
bin | 11101101100010011110… |
… | …10010000110100111001 |
3 | 10121112100221210201010122 |
4 | 32312021322100310321 |
5 | 113203403034013032 |
6 | 2100403312423025 |
7 | 133465012265531 |
oct | 16661172206471 |
9 | 3545327721118 |
10 | 1020221001017 |
11 | 363745181289 |
12 | 145885b47a75 |
13 | 7528b6a16ba |
14 | 37543c1a4c1 |
15 | 1b811ad9012 |
hex | ed89e90d39 |
1020221001017 has 2 divisors, whose sum is σ = 1020221001018. Its totient is φ = 1020221001016.
The previous prime is 1020221000989. The next prime is 1020221001029. The reversal of 1020221001017 is 7101001220201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 639014779456 + 381206221561 = 799384^2 + 617419^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020221001017 is a prime.
It is a super-2 number, since 2×10202210010172 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020221000986 and 1020221001004.
It is not a weakly prime, because it can be changed into another prime (1020221003017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510110500508 + 510110500509.
It is an arithmetic number, because the mean of its divisors is an integer number (510110500509).
Almost surely, 21020221001017 is an apocalyptic number.
It is an amenable number.
1020221001017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020221001017 is an equidigital number, since it uses as much as digits as its factorization.
1020221001017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 1020221001017 its reverse (7101001220201), we get a palindrome (8121222221218).
The spelling of 1020221001017 in words is "one trillion, twenty billion, two hundred twenty-one million, one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •