Base | Representation |
---|---|
bin | 11101001011011011011… |
… | …000010011101010100001 |
3 | 21002200121022220021011212 |
4 | 131023123120103222201 |
5 | 230323004121422431 |
6 | 4133051345115505 |
7 | 264603060123233 |
oct | 35133330235241 |
9 | 7080538807155 |
10 | 2005135342241 |
11 | 703411699489 |
12 | 284737928b95 |
13 | 11711145c215 |
14 | 6d098902253 |
15 | 37258c6a72b |
hex | 1d2db613aa1 |
2005135342241 has 4 divisors (see below), whose sum is σ = 2007963460500. Its totient is φ = 2002307223984.
The previous prime is 2005135342211. The next prime is 2005135342303. The reversal of 2005135342241 is 1422435315002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1112752826641 + 892382515600 = 1054871^2 + 944660^2 .
It is a cyclic number.
It is not a de Polignac number, because 2005135342241 - 218 = 2005135080097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2005135342198 and 2005135342207.
It is not an unprimeable number, because it can be changed into a prime (2005135342211) 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, 1414058066 + ... + 1414059483.
It is an arithmetic number, because the mean of its divisors is an integer number (501990865125).
Almost surely, 22005135342241 is an apocalyptic number.
It is an amenable number.
2005135342241 is a deficient number, since it is larger than the sum of its proper divisors (2828118259).
2005135342241 is an equidigital number, since it uses as much as digits as its factorization.
2005135342241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2828118258.
The product of its (nonzero) digits is 28800, while the sum is 32.
The spelling of 2005135342241 in words is "two trillion, five billion, one hundred thirty-five million, three hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •