Base | Representation |
---|---|
bin | 111101000110010… |
… | …1100000000010111 |
3 | 12021212201020001110 |
4 | 1322030230000113 |
5 | 13144314140302 |
6 | 535233430103 |
7 | 101542645665 |
oct | 17214540027 |
9 | 5255636043 |
10 | 2050146327 |
11 | 962288309 |
12 | 49270b333 |
13 | 268984248 |
14 | 1563cdc35 |
15 | beebab6c |
hex | 7a32c017 |
2050146327 has 4 divisors (see below), whose sum is σ = 2733528440. Its totient is φ = 1366764216.
The previous prime is 2050146323. The next prime is 2050146347. The reversal of 2050146327 is 7236410502.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2050146327 - 22 = 2050146323 is a prime.
It is a super-2 number, since 2×20501463272 = 8406199924223181858, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2050146294 and 2050146303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050146323) 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, 341691052 + ... + 341691057.
It is an arithmetic number, because the mean of its divisors is an integer number (683382110).
Almost surely, 22050146327 is an apocalyptic number.
2050146327 is a deficient number, since it is larger than the sum of its proper divisors (683382113).
2050146327 is an equidigital number, since it uses as much as digits as its factorization.
2050146327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 683382112.
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 2050146327 is about 45278.5415732442. The cubic root of 2050146327 is about 1270.3643171228.
Adding to 2050146327 its reverse (7236410502), we get a palindrome (9286556829).
The spelling of 2050146327 in words is "two billion, fifty million, one hundred forty-six thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •