Base | Representation |
---|---|
bin | 1001001111101110000010… |
… | …01110011110110110100001 |
3 | 2122222122200210021112222212 |
4 | 10213313001032132312201 |
5 | 10131102021413323131 |
6 | 111124025210411505 |
7 | 4165614053446556 |
oct | 447670116366641 |
9 | 78878623245885 |
10 | 20331322011041 |
11 | 6529513269878 |
12 | 234441a730b95 |
13 | b4630a34b292 |
14 | 504081218a2d |
15 | 253ce725aa2b |
hex | 127dc139eda1 |
20331322011041 has 2 divisors, whose sum is σ = 20331322011042. Its totient is φ = 20331322011040.
The previous prime is 20331322010969. The next prime is 20331322011067. The reversal of 20331322011041 is 14011022313302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17041828830625 + 3289493180416 = 4128175^2 + 1813696^2 .
It is a cyclic number.
It is not a de Polignac number, because 20331322011041 - 214 = 20331321994657 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20331322010998 and 20331322011016.
It is not a weakly prime, because it can be changed into another prime (20331322011541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10165661005520 + 10165661005521.
It is an arithmetic number, because the mean of its divisors is an integer number (10165661005521).
Almost surely, 220331322011041 is an apocalyptic number.
It is an amenable number.
20331322011041 is a deficient number, since it is larger than the sum of its proper divisors (1).
20331322011041 is an equidigital number, since it uses as much as digits as its factorization.
20331322011041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20331322011041 its reverse (14011022313302), we get a palindrome (34342344324343).
The spelling of 20331322011041 in words is "twenty trillion, three hundred thirty-one billion, three hundred twenty-two million, eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •