Base | Representation |
---|---|
bin | 11101110101100001111… |
… | …111010111001001011001 |
3 | 21021000021221211112212101 |
4 | 131311201333113021121 |
5 | 232043100402300100 |
6 | 4205525330443401 |
7 | 301063264226044 |
oct | 35654177271131 |
9 | 7230257745771 |
10 | 2050343400025 |
11 | 720600440408 |
12 | 291453a33561 |
13 | 11b4674b917b |
14 | 71346a4dc5b |
15 | 38502aa586a |
hex | 1dd61fd7259 |
2050343400025 has 24 divisors (see below), whose sum is σ = 2569125348440. Its totient is φ = 1623055656960.
The previous prime is 2050343400023. The next prime is 2050343400029. The reversal of 2050343400025 is 5200043430502.
It can be written as a sum of positive squares in 12 ways, for example, as 387295873561 + 1663047526464 = 622331^2 + 1289592^2 .
It is not a de Polignac number, because 2050343400025 - 21 = 2050343400023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2050343399966 and 2050343400002.
It is not an unprimeable number, because it can be changed into a prime (2050343400023) 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, 13106971 + ... + 13262479.
Almost surely, 22050343400025 is an apocalyptic number.
2050343400025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2050343400025 is a deficient number, since it is larger than the sum of its proper divisors (518781948415).
2050343400025 is a wasteful number, since it uses less digits than its factorization.
2050343400025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161053 (or 161048 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 28.
Adding to 2050343400025 its reverse (5200043430502), we get a palindrome (7250386830527).
The spelling of 2050343400025 in words is "two trillion, fifty billion, three hundred forty-three million, four hundred thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •