Base | Representation |
---|---|
bin | 11101000111000111111… |
… | …011011100001011001101 |
3 | 21002020200021002211000001 |
4 | 131013013323130023031 |
5 | 230234023043244100 |
6 | 4131005022404301 |
7 | 264350413530340 |
oct | 35070773341315 |
9 | 7066607084001 |
10 | 2000514040525 |
11 | 701460028070 |
12 | 283868130691 |
13 | 116855bc4170 |
14 | 6cb7ac5c457 |
15 | 370881bad6a |
hex | 1d1c7edc2cd |
2000514040525 has 192 divisors, whose sum is σ = 3390204013056. Its totient is φ = 1130692608000.
The previous prime is 2000514040507. The next prime is 2000514040589. The reversal of 2000514040525 is 5250404150002.
It is not a de Polignac number, because 2000514040525 - 27 = 2000514040397 is a prime.
It is a super-2 number, since 2×20005140405252 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2000514040493 and 2000514040502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 469491895 + ... + 469496155.
It is an arithmetic number, because the mean of its divisors is an integer number (17657312568).
Almost surely, 22000514040525 is an apocalyptic number.
2000514040525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2000514040525 is a deficient number, since it is larger than the sum of its proper divisors (1389689972531).
2000514040525 is a wasteful number, since it uses less digits than its factorization.
2000514040525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4632 (or 4627 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
Adding to 2000514040525 its reverse (5250404150002), we get a palindrome (7250918190527).
The spelling of 2000514040525 in words is "two trillion, five hundred fourteen million, forty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •