Base | Representation |
---|---|
bin | 1001000110001000110100… |
… | …01000000100110100101101 |
3 | 2121211011220210220111000021 |
4 | 10203010122020010310231 |
5 | 10110203300330200442 |
6 | 110312501030202141 |
7 | 4133050465303303 |
oct | 443043210046455 |
9 | 77734823814007 |
10 | 20002101021997 |
11 | 6411930633a56 |
12 | 22b065b1b3351 |
13 | b2126166bb13 |
14 | 4d216d2d2273 |
15 | 24a479550e67 |
hex | 12311a204d2d |
20002101021997 has 2 divisors, whose sum is σ = 20002101021998. Its totient is φ = 20002101021996.
The previous prime is 20002101021961. The next prime is 20002101022009. The reversal of 20002101021997 is 79912010120002.
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., 20001878743716 + 222278281 = 4472346^2 + 14909^2 .
It is a cyclic number.
It is not a de Polignac number, because 20002101021997 - 227 = 20001966804269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20002101021697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001050510998 + 10001050510999.
It is an arithmetic number, because the mean of its divisors is an integer number (10001050510999).
Almost surely, 220002101021997 is an apocalyptic number.
It is an amenable number.
20002101021997 is a deficient number, since it is larger than the sum of its proper divisors (1).
20002101021997 is an equidigital number, since it uses as much as digits as its factorization.
20002101021997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 34.
Adding to 20002101021997 its reverse (79912010120002), we get a palindrome (99914111141999).
The spelling of 20002101021997 in words is "twenty trillion, two billion, one hundred one million, twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •