Base | Representation |
---|---|
bin | 1001000110101110001111… |
… | …11100000101100011111001 |
3 | 2121220002210100000010110101 |
4 | 10203113013330011203321 |
5 | 10111020424411442212 |
6 | 110330023104315401 |
7 | 4134361464204052 |
oct | 443270774054371 |
9 | 77802710003411 |
10 | 20022196984057 |
11 | 641a403246764 |
12 | 22b4529312b61 |
13 | b23114ba5328 |
14 | 4d3118237729 |
15 | 24ac53925157 |
hex | 1235c7f058f9 |
20022196984057 has 2 divisors, whose sum is σ = 20022196984058. Its totient is φ = 20022196984056.
The previous prime is 20022196984037. The next prime is 20022196984063. The reversal of 20022196984057 is 75048969122002.
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., 16829324750736 + 3192872233321 = 4102356^2 + 1786861^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022196984057 - 211 = 20022196982009 is a prime.
It is a super-3 number, since 3×200221969840573 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20022196983989 and 20022196984007.
It is not a weakly prime, because it can be changed into another prime (20022196984007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011098492028 + 10011098492029.
It is an arithmetic number, because the mean of its divisors is an integer number (10011098492029).
Almost surely, 220022196984057 is an apocalyptic number.
It is an amenable number.
20022196984057 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022196984057 is an equidigital number, since it uses as much as digits as its factorization.
20022196984057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4354560, while the sum is 55.
The spelling of 20022196984057 in words is "twenty trillion, twenty-two billion, one hundred ninety-six million, nine hundred eighty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •