Base | Representation |
---|---|
bin | 1001000110101100000011… |
… | …11010010000111100001001 |
3 | 2121212222202110020220020121 |
4 | 10203112001322100330021 |
5 | 10111011023124220012 |
6 | 110325310334423241 |
7 | 4134320406646552 |
oct | 443260172207411 |
9 | 77788673226217 |
10 | 20021022101257 |
11 | 6419960035941 |
12 | 22b425b961b21 |
13 | b22c886664c8 |
14 | 4d30461a5329 |
15 | 24abd56eba07 |
hex | 123581e90f09 |
20021022101257 has 2 divisors, whose sum is σ = 20021022101258. Its totient is φ = 20021022101256.
The previous prime is 20021022101141. The next prime is 20021022101347. The reversal of 20021022101257 is 75210122012002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16472850872976 + 3548171228281 = 4058676^2 + 1883659^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021022101257 - 235 = 19986662362889 is a prime.
It is not a weakly prime, because it can be changed into another prime (20021022101357) 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, 10010511050628 + 10010511050629.
It is an arithmetic number, because the mean of its divisors is an integer number (10010511050629).
Almost surely, 220021022101257 is an apocalyptic number.
It is an amenable number.
20021022101257 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021022101257 is an equidigital number, since it uses as much as digits as its factorization.
20021022101257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 20021022101257 its reverse (75210122012002), we get a palindrome (95231144113259).
The spelling of 20021022101257 in words is "twenty trillion, twenty-one billion, twenty-two million, one hundred one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •