Base | Representation |
---|---|
bin | 11101000110110001001… |
… | …110010001001100100001 |
3 | 21002012200201022001021121 |
4 | 131012301032101030201 |
5 | 230232233033202241 |
6 | 4130503133452241 |
7 | 264335106560446 |
oct | 35066116211441 |
9 | 7065621261247 |
10 | 2000133100321 |
11 | 701284aa0054 |
12 | 283780641081 |
13 | 1167c4cc7065 |
14 | 6cb424199cd |
15 | 37064a1ead1 |
hex | 1d1b1391321 |
2000133100321 has 4 divisors (see below), whose sum is σ = 2064653522944. Its totient is φ = 1935612677700.
The previous prime is 2000133100271. The next prime is 2000133100331. The reversal of 2000133100321 is 1230013310002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2000133100321 - 217 = 2000132969249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000133100295 and 2000133100304.
It is not an unprimeable number, because it can be changed into a prime (2000133100331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32260211265 + ... + 32260211326.
It is an arithmetic number, because the mean of its divisors is an integer number (516163380736).
Almost surely, 22000133100321 is an apocalyptic number.
It is an amenable number.
2000133100321 is a deficient number, since it is larger than the sum of its proper divisors (64520422623).
2000133100321 is an equidigital number, since it uses as much as digits as its factorization.
2000133100321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64520422622.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2000133100321 its reverse (1230013310002), we get a palindrome (3230146410323).
The spelling of 2000133100321 in words is "two trillion, one hundred thirty-three million, one hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •