Base | Representation |
---|---|
bin | 1001100011110001011010… |
… | …11111100101001010111001 |
3 | 2202102112011011101111221101 |
4 | 10301320231133211022321 |
5 | 10223344120244400212 |
6 | 112412335135411401 |
7 | 4266445311101362 |
oct | 461705537451271 |
9 | 82375134344841 |
10 | 21020333200057 |
11 | 67747451020a4 |
12 | 2435a6b083b61 |
13 | b96293caa6a9 |
14 | 529564d22b69 |
15 | 266bc1734157 |
hex | 131e2d7e52b9 |
21020333200057 has 2 divisors, whose sum is σ = 21020333200058. Its totient is φ = 21020333200056.
The previous prime is 21020333200039. The next prime is 21020333200211. The reversal of 21020333200057 is 75000233302012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19343072501776 + 1677260698281 = 4398076^2 + 1295091^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21020333200057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21020333199998 and 21020333200034.
It is not a weakly prime, because it can be changed into another prime (21020333200037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510166600028 + 10510166600029.
It is an arithmetic number, because the mean of its divisors is an integer number (10510166600029).
Almost surely, 221020333200057 is an apocalyptic number.
It is an amenable number.
21020333200057 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020333200057 is an equidigital number, since it uses as much as digits as its factorization.
21020333200057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 28.
Adding to 21020333200057 its reverse (75000233302012), we get a palindrome (96020566502069).
The spelling of 21020333200057 in words is "twenty-one trillion, twenty billion, three hundred thirty-three million, two hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •