Base | Representation |
---|---|
bin | 10010101110000111… |
… | …101100011111100001 |
3 | 1220212212210210120122 |
4 | 102232013230133201 |
5 | 312131341401032 |
6 | 13122340450025 |
7 | 1311060501164 |
oct | 225607543741 |
9 | 56785723518 |
10 | 20101122017 |
11 | 8585617539 |
12 | 3a8b9a9915 |
13 | 1b84622052 |
14 | d898c9adb |
15 | 7c9a93012 |
hex | 4ae1ec7e1 |
20101122017 has 2 divisors, whose sum is σ = 20101122018. Its totient is φ = 20101122016.
The previous prime is 20101121987. The next prime is 20101122047. The reversal of 20101122017 is 71022110102.
It is a balanced prime because it is at equal distance from previous prime (20101121987) and next prime (20101122047).
It can be written as a sum of positive squares in only one way, i.e., 18780235681 + 1320886336 = 137041^2 + 36344^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101122017 - 212 = 20101117921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101121986 and 20101122004.
It is not a weakly prime, because it can be changed into another prime (20101122047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050561008 + 10050561009.
It is an arithmetic number, because the mean of its divisors is an integer number (10050561009).
Almost surely, 220101122017 is an apocalyptic number.
It is an amenable number.
20101122017 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101122017 is an equidigital number, since it uses as much as digits as its factorization.
20101122017 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 20101122017 its reverse (71022110102), we get a palindrome (91123232119).
The spelling of 20101122017 in words is "twenty billion, one hundred one million, one hundred twenty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •