Base | Representation |
---|---|
bin | 11101000110111100011… |
… | …000011101101001011101 |
3 | 21002020011202120220100002 |
4 | 131012330120131221131 |
5 | 230233124000302031 |
6 | 4130533502344045 |
7 | 264342542124611 |
oct | 35067430355135 |
9 | 7066152526302 |
10 | 2000320322141 |
11 | 701370745629 |
12 | 28381328b025 |
13 | 116824a290bb |
14 | 6cb5d233341 |
15 | 370761a2ccb |
hex | 1d1bc61da5d |
2000320322141 has 2 divisors, whose sum is σ = 2000320322142. Its totient is φ = 2000320322140.
The previous prime is 2000320322029. The next prime is 2000320322173. The reversal of 2000320322141 is 1412230230002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1900458002041 + 99862320100 = 1378571^2 + 316010^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000320322141 - 210 = 2000320321117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000320325141) 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, 1000160161070 + 1000160161071.
It is an arithmetic number, because the mean of its divisors is an integer number (1000160161071).
Almost surely, 22000320322141 is an apocalyptic number.
It is an amenable number.
2000320322141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000320322141 is an equidigital number, since it uses as much as digits as its factorization.
2000320322141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2000320322141 its reverse (1412230230002), we get a palindrome (3412550552143).
The spelling of 2000320322141 in words is "two trillion, three hundred twenty million, three hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •