Base | Representation |
---|---|
bin | 111011110000110… |
… | …1101010101010111 |
3 | 12011202101001221121 |
4 | 1313201231111113 |
5 | 13101330401033 |
6 | 530553024411 |
7 | 100456660663 |
oct | 16741552527 |
9 | 5152331847 |
10 | 2005325143 |
11 | 939a54508 |
12 | 47b6b5107 |
13 | 25c5c0133 |
14 | 1504838a3 |
15 | bb0b562d |
hex | 7786d557 |
2005325143 has 4 divisors (see below), whose sum is σ = 2006052640. Its totient is φ = 2004597648.
The previous prime is 2005325141. The next prime is 2005325159. The reversal of 2005325143 is 3415235002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3415235002 = 2 ⋅1707617501.
It is a cyclic number.
It is not a de Polignac number, because 2005325143 - 21 = 2005325141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2005325141) 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 in 3 ways as a sum of consecutive naturals, for example, 359598 + ... + 365131.
It is an arithmetic number, because the mean of its divisors is an integer number (501513160).
Almost surely, 22005325143 is an apocalyptic number.
2005325143 is a deficient number, since it is larger than the sum of its proper divisors (727497).
2005325143 is an equidigital number, since it uses as much as digits as its factorization.
2005325143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727496.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 2005325143 is about 44780.8568810379. The cubic root of 2005325143 is about 1261.0382688822.
The spelling of 2005325143 in words is "two billion, five million, three hundred twenty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •