Base | Representation |
---|---|
bin | 11101000110110001001… |
… | …110010001001011010001 |
3 | 21002012200201022001011122 |
4 | 131012301032101023101 |
5 | 230232233033201431 |
6 | 4130503133452025 |
7 | 264335106560303 |
oct | 35066116211321 |
9 | 7065621261148 |
10 | 2000133100241 |
11 | 701284a9aa91 |
12 | 283780641015 |
13 | 1167c4cc7003 |
14 | 6cb42419973 |
15 | 37064a1ea7b |
hex | 1d1b13912d1 |
2000133100241 has 2 divisors, whose sum is σ = 2000133100242. Its totient is φ = 2000133100240.
The previous prime is 2000133100181. The next prime is 2000133100243. The reversal of 2000133100241 is 1420013310002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1996792260241 + 3340840000 = 1413079^2 + 57800^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000133100241 - 234 = 1982953231057 is a prime.
Together with 2000133100243, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2000133100243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000066550120 + 1000066550121.
It is an arithmetic number, because the mean of its divisors is an integer number (1000066550121).
Almost surely, 22000133100241 is an apocalyptic number.
It is an amenable number.
2000133100241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000133100241 is an equidigital number, since it uses as much as digits as its factorization.
2000133100241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2000133100241 its reverse (1420013310002), we get a palindrome (3420146410243).
The spelling of 2000133100241 in words is "two trillion, one hundred thirty-three million, one hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •