Base | Representation |
---|---|
bin | 1001000110101100001110… |
… | …01110100110111000110101 |
3 | 2121212222222200010200111211 |
4 | 10203112013032212320311 |
5 | 10111011213444220432 |
6 | 110325323243001421 |
7 | 4134322542210055 |
oct | 443260716467065 |
9 | 77788880120454 |
10 | 20021111320117 |
11 | 64199a6433336 |
12 | 22b4285809271 |
13 | b22ca0ca3a2b |
14 | 4d3053d8b565 |
15 | 24abdd471d47 |
hex | 1235873a6e35 |
20021111320117 has 2 divisors, whose sum is σ = 20021111320118. Its totient is φ = 20021111320116.
The previous prime is 20021111320103. The next prime is 20021111320141. The reversal of 20021111320117 is 71102311112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14983820359236 + 5037290960881 = 3870894^2 + 2244391^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021111320117 - 223 = 20021102931509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20021111320417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010555660058 + 10010555660059.
It is an arithmetic number, because the mean of its divisors is an integer number (10010555660059).
Almost surely, 220021111320117 is an apocalyptic number.
It is an amenable number.
20021111320117 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021111320117 is an equidigital number, since it uses as much as digits as its factorization.
20021111320117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 20021111320117 its reverse (71102311112002), we get a palindrome (91123422432119).
The spelling of 20021111320117 in words is "twenty trillion, twenty-one billion, one hundred eleven million, three hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •