Base | Representation |
---|---|
bin | 11101001011110001001… |
… | …011101110100110000001 |
3 | 21002201112211012220001212 |
4 | 131023301023232212001 |
5 | 230324231243042200 |
6 | 4133151533335505 |
7 | 264615121311053 |
oct | 35136113564601 |
9 | 7081484186055 |
10 | 2005501143425 |
11 | 70358a12630a |
12 | 28481a337595 |
13 | 11716c188620 |
14 | 6d0d13238d3 |
15 | 3727ae26035 |
hex | 1d2f12ee981 |
2005501143425 has 48 divisors (see below), whose sum is σ = 2785322852928. Its totient is φ = 1422829497600.
The previous prime is 2005501143413. The next prime is 2005501143469. The reversal of 2005501143425 is 5243411055002.
It is not a de Polignac number, because 2005501143425 - 214 = 2005501127041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2005501143391 and 2005501143400.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 323807 + ... + 2028756.
It is an arithmetic number, because the mean of its divisors is an integer number (58027559436).
Almost surely, 22005501143425 is an apocalyptic number.
2005501143425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2005501143425 is a deficient number, since it is larger than the sum of its proper divisors (779821709503).
2005501143425 is a wasteful number, since it uses less digits than its factorization.
2005501143425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2352690 (or 2352685 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 2005501143425 its reverse (5243411055002), we get a palindrome (7248912198427).
The spelling of 2005501143425 in words is "two trillion, five billion, five hundred one million, one hundred forty-three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •