Base | Representation |
---|---|
bin | 11101110101100001111… |
… | …111010111011101111101 |
3 | 21021000021221211121200010 |
4 | 131311201333113131331 |
5 | 232043100402320331 |
6 | 4205525330453433 |
7 | 301063264232634 |
oct | 35654177273575 |
9 | 7230257747603 |
10 | 2050343401341 |
11 | 7206004413a4 |
12 | 291453a34279 |
13 | 11b4674b9951 |
14 | 71346a5051b |
15 | 38502aa5e46 |
hex | 1dd61fd777d |
2050343401341 has 32 divisors (see below), whose sum is σ = 2929286135808. Its totient is φ = 1271137821440.
The previous prime is 2050343401333. The next prime is 2050343401387. The reversal of 2050343401341 is 1431043430502.
It is a cyclic number.
It is not a de Polignac number, because 2050343401341 - 23 = 2050343401333 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2050343401299 and 2050343401308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050343401321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1599526 + ... + 2580536.
It is an arithmetic number, because the mean of its divisors is an integer number (91540191744).
Almost surely, 22050343401341 is an apocalyptic number.
It is an amenable number.
2050343401341 is a deficient number, since it is larger than the sum of its proper divisors (878942734467).
2050343401341 is a wasteful number, since it uses less digits than its factorization.
2050343401341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981521.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 2050343401341 its reverse (1431043430502), we get a palindrome (3481386831843).
The spelling of 2050343401341 in words is "two trillion, fifty billion, three hundred forty-three million, four hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •