Base | Representation |
---|---|
bin | 1001001100100000111101… |
… | …10001000010001100100001 |
3 | 2122121010111202001122202011 |
4 | 10212100132301002030201 |
5 | 10122301030340400342 |
6 | 111001300133352521 |
7 | 4154635510502242 |
oct | 446203661021441 |
9 | 78533452048664 |
10 | 20221222200097 |
11 | 6496854847286 |
12 | 2327012498741 |
13 | b38b12275959 |
14 | 4dc9d8a92cc9 |
15 | 2510014e9717 |
hex | 12641ec42321 |
20221222200097 has 2 divisors, whose sum is σ = 20221222200098. Its totient is φ = 20221222200096.
The previous prime is 20221222199977. The next prime is 20221222200143. The reversal of 20221222200097 is 79000222212202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18348509322256 + 1872712877841 = 4283516^2 + 1368471^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20221222200097 is a prime.
It is not a weakly prime, because it can be changed into another prime (20221222200997) 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, 10110611100048 + 10110611100049.
It is an arithmetic number, because the mean of its divisors is an integer number (10110611100049).
Almost surely, 220221222200097 is an apocalyptic number.
It is an amenable number.
20221222200097 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221222200097 is an equidigital number, since it uses as much as digits as its factorization.
20221222200097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 20221222200097 its reverse (79000222212202), we get a palindrome (99221444412299).
The spelling of 20221222200097 in words is "twenty trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •