Base | Representation |
---|---|
bin | 111011110000100… |
… | …0000111101111111 |
3 | 12011202000211200020 |
4 | 1313201000331333 |
5 | 13101304042143 |
6 | 530545103223 |
7 | 100455303123 |
oct | 16741007577 |
9 | 5152024606 |
10 | 2005143423 |
11 | 93993aa28 |
12 | 47b627b13 |
13 | 25c5584ca |
14 | 150437583 |
15 | bb07b883 |
hex | 77840f7f |
2005143423 has 8 divisors (see below), whose sum is σ = 2679251328. Its totient is φ = 1333898904.
The previous prime is 2005143409. The next prime is 2005143451. The reversal of 2005143423 is 3243415002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2005143423 - 220 = 2004094847 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2005143393 and 2005143402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2005143463) 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 7 ways as a sum of consecutive naturals, for example, 714211 + ... + 717012.
It is an arithmetic number, because the mean of its divisors is an integer number (334906416).
Almost surely, 22005143423 is an apocalyptic number.
2005143423 is a deficient number, since it is larger than the sum of its proper divisors (674107905).
2005143423 is a wasteful number, since it uses less digits than its factorization.
2005143423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1431693.
The product of its (nonzero) digits is 2880, while the sum is 24.
The square root of 2005143423 is about 44778.8278430778. The cubic root of 2005143423 is about 1261.0001765065. Note that the first 3 decimals are identical.
Adding to 2005143423 its reverse (3243415002), we get a palindrome (5248558425).
The spelling of 2005143423 in words is "two billion, five million, one hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •