Base | Representation |
---|---|
bin | 11101001011111010110… |
… | …101010000110010010001 |
3 | 21002201222002211101122200 |
4 | 131023322311100302101 |
5 | 230330044213320241 |
6 | 4133215555153413 |
7 | 264622125301623 |
oct | 35137265206221 |
9 | 7081862741580 |
10 | 2005663026321 |
11 | 703662544329 |
12 | 2848645a5869 |
13 | 117196888116 |
14 | 6d108a22c13 |
15 | 3728a2514b6 |
hex | 1d2fad50c91 |
2005663026321 has 24 divisors (see below), whose sum is σ = 2947206045576. Its totient is φ = 1314098795520.
The previous prime is 2005663026281. The next prime is 2005663026403. The reversal of 2005663026321 is 1236203665002.
2005663026321 is a `hidden beast` number, since 2 + 0 + 0 + 566 + 30 + 2 + 63 + 2 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 739194135696 + 1266468890625 = 859764^2 + 1125375^2 .
It is not a de Polignac number, because 2005663026321 - 230 = 2004589284497 is a prime.
It is a super-2 number, since 2×20056630263212 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2005663026721) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5247340 + ... + 5616573.
It is an arithmetic number, because the mean of its divisors is an integer number (122800251899).
Almost surely, 22005663026321 is an apocalyptic number.
It is an amenable number.
2005663026321 is a deficient number, since it is larger than the sum of its proper divisors (941543019255).
2005663026321 is a wasteful number, since it uses less digits than its factorization.
2005663026321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10864273 (or 10864270 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 2005663026321 in words is "two trillion, five billion, six hundred sixty-three million, twenty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •