Base | Representation |
---|---|
bin | 11101110101001111100… |
… | …011011000110010011001 |
3 | 21020222111101210022012120 |
4 | 131311033203120302121 |
5 | 232041432210424300 |
6 | 4205434520531453 |
7 | 301052520066120 |
oct | 35651743306231 |
9 | 7228441708176 |
10 | 2050034076825 |
11 | 7204618792a9 |
12 | 291388320b89 |
13 | 11b4183a58a7 |
14 | 71317930ab7 |
15 | 384d58543a0 |
hex | 1dd4f8d8c99 |
2050034076825 has 48 divisors (see below), whose sum is σ = 3882576070656. Its totient is φ = 934983950400.
The previous prime is 2050034076823. The next prime is 2050034076833. The reversal of 2050034076825 is 5286704300502.
It is not a de Polignac number, because 2050034076825 - 21 = 2050034076823 is a prime.
It is a super-2 number, since 2×20500340768252 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2050034076823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4303687 + ... + 4756236.
It is an arithmetic number, because the mean of its divisors is an integer number (80887001472).
Almost surely, 22050034076825 is an apocalyptic number.
2050034076825 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2050034076825 is a deficient number, since it is larger than the sum of its proper divisors (1832541993831).
2050034076825 is a wasteful number, since it uses less digits than its factorization.
2050034076825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9060374 (or 9060369 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 42.
The spelling of 2050034076825 in words is "two trillion, fifty billion, thirty-four million, seventy-six thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •