Base | Representation |
---|---|
bin | 1001000110010111111100… |
… | …01011111101001100111001 |
3 | 2121211221212210100200012101 |
4 | 10203023332023331030321 |
5 | 10110321413341240042 |
6 | 110320322535343401 |
7 | 4133455650261631 |
oct | 443137613751471 |
9 | 77757783320171 |
10 | 20010222211897 |
11 | 6415318856145 |
12 | 22b2146b21b61 |
13 | b21c57034628 |
14 | 4d26ddb056c1 |
15 | 24a7a24d96b7 |
hex | 1232fe2fd339 |
20010222211897 has 2 divisors, whose sum is σ = 20010222211898. Its totient is φ = 20010222211896.
The previous prime is 20010222211879. The next prime is 20010222211963. The reversal of 20010222211897 is 79811222201002.
Together with previous prime (20010222211879) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16902656128656 + 3107566083241 = 4111284^2 + 1762829^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010222211897 - 231 = 20008074728249 is a prime.
It is not a weakly prime, because it can be changed into another prime (20010222211807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005111105948 + 10005111105949.
It is an arithmetic number, because the mean of its divisors is an integer number (10005111105949).
Almost surely, 220010222211897 is an apocalyptic number.
It is an amenable number.
20010222211897 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010222211897 is an equidigital number, since it uses as much as digits as its factorization.
20010222211897 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16128, while the sum is 37.
Adding to 20010222211897 its reverse (79811222201002), we get a palindrome (99821444412899).
The spelling of 20010222211897 in words is "twenty trillion, ten billion, two hundred twenty-two million, two hundred eleven thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •