Base | Representation |
---|---|
bin | 11101000110111101000… |
… | …101000011011100101111 |
3 | 21002020012120120202212022 |
4 | 131012331011003130233 |
5 | 230233134443330221 |
6 | 4130535001100355 |
7 | 264343043361044 |
oct | 35067505033457 |
9 | 7066176522768 |
10 | 2000332011311 |
11 | 7013772a98a7 |
12 | 2838171876bb |
13 | 11682728c77a |
14 | 6cb609d71cb |
15 | 370772114ab |
hex | 1d1bd14372f |
2000332011311 has 2 divisors, whose sum is σ = 2000332011312. Its totient is φ = 2000332011310.
The previous prime is 2000332011221. The next prime is 2000332011329. The reversal of 2000332011311 is 1131102330002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000332011311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2000332011311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000332011341) 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, 1000166005655 + 1000166005656.
It is an arithmetic number, because the mean of its divisors is an integer number (1000166005656).
Almost surely, 22000332011311 is an apocalyptic number.
2000332011311 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000332011311 is an equidigital number, since it uses as much as digits as its factorization.
2000332011311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2000332011311 its reverse (1131102330002), we get a palindrome (3131434341313).
The spelling of 2000332011311 in words is "two trillion, three hundred thirty-two million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •