Base | Representation |
---|---|
bin | 11101110101001101100… |
… | …010101110101101010101 |
3 | 21020222102001022210202021 |
4 | 131311031202232231111 |
5 | 232041400042200122 |
6 | 4205431314013141 |
7 | 301051630316233 |
oct | 35651542565525 |
9 | 7228361283667 |
10 | 2050000350037 |
11 | 720444832922 |
12 | 291378b771b1 |
13 | 11b4113c7503 |
14 | 71313271953 |
15 | 384d28e11c7 |
hex | 1dd4d8aeb55 |
2050000350037 has 4 divisors (see below), whose sum is σ = 2050700728896. Its totient is φ = 2049299971180.
The previous prime is 2050000349993. The next prime is 2050000350077. The reversal of 2050000350037 is 7300530000502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2050000350037 - 227 = 2049866132309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2050000349993 and 2050000350020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050000350077) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350185039 + ... + 350190892.
It is an arithmetic number, because the mean of its divisors is an integer number (512675182224).
Almost surely, 22050000350037 is an apocalyptic number.
It is an amenable number.
2050000350037 is a deficient number, since it is larger than the sum of its proper divisors (700378859).
2050000350037 is an equidigital number, since it uses as much as digits as its factorization.
2050000350037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700378858.
The product of its (nonzero) digits is 3150, while the sum is 25.
Adding to 2050000350037 its reverse (7300530000502), we get a palindrome (9350530350539).
The spelling of 2050000350037 in words is "two trillion, fifty billion, three hundred fifty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •