Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …01010000101001100011001 |
3 | 2121211012011212022102100201 |
4 | 10203010200022011030121 |
5 | 10110204002231223342 |
6 | 110312515043102201 |
7 | 4133053134350251 |
oct | 443044012051431 |
9 | 77735155272321 |
10 | 20002202211097 |
11 | 6411982767907 |
12 | 22b0689071961 |
13 | b2127960a922 |
14 | 4d217c912961 |
15 | 24a48338cdb7 |
hex | 123120285319 |
20002202211097 has 2 divisors, whose sum is σ = 20002202211098. Its totient is φ = 20002202211096.
The previous prime is 20002202211053. The next prime is 20002202211301. The reversal of 20002202211097 is 79011220220002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14333879292121 + 5668322918976 = 3786011^2 + 2380824^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20002202211097 is a prime.
It is a super-3 number, since 3×200022022110973 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (20002202217097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001101105548 + 10001101105549.
It is an arithmetic number, because the mean of its divisors is an integer number (10001101105549).
Almost surely, 220002202211097 is an apocalyptic number.
It is an amenable number.
20002202211097 is a deficient number, since it is larger than the sum of its proper divisors (1).
20002202211097 is an equidigital number, since it uses as much as digits as its factorization.
20002202211097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 20002202211097 its reverse (79011220220002), we get a palindrome (99013422431099).
The spelling of 20002202211097 in words is "twenty trillion, two billion, two hundred two million, two hundred eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •