Base | Representation |
---|---|
bin | 11101011001010111011… |
… | …001110000111101100001 |
3 | 21011010020022102111121201 |
4 | 131121113121300331201 |
5 | 231044131324013212 |
6 | 4144004355121201 |
7 | 265642662123466 |
oct | 35312731607541 |
9 | 7133208374551 |
10 | 2020101001057 |
11 | 7097a1395457 |
12 | 2876138a3201 |
13 | 118657b43339 |
14 | 6dab834766d |
15 | 37832a49b57 |
hex | 1d657670f61 |
2020101001057 has 2 divisors, whose sum is σ = 2020101001058. Its totient is φ = 2020101001056.
The previous prime is 2020101001001. The next prime is 2020101001109. The reversal of 2020101001057 is 7501001010202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1250838691281 + 769262309776 = 1118409^2 + 877076^2 .
It is a cyclic number.
It is not a de Polignac number, because 2020101001057 - 239 = 1470345187169 is a prime.
It is a super-3 number, since 3×20201010010573 (a number of 38 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (2020101011057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010050500528 + 1010050500529.
It is an arithmetic number, because the mean of its divisors is an integer number (1010050500529).
Almost surely, 22020101001057 is an apocalyptic number.
It is an amenable number.
2020101001057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2020101001057 is an equidigital number, since it uses as much as digits as its factorization.
2020101001057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
Adding to 2020101001057 its reverse (7501001010202), we get a palindrome (9521102011259).
The spelling of 2020101001057 in words is "two trillion, twenty billion, one hundred one million, one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •