Base | Representation |
---|---|
bin | 11101110101010100110… |
… | …100100000100101111001 |
3 | 21020222201120002012020001 |
4 | 131311110310200211321 |
5 | 232042122321420241 |
6 | 4205451355033001 |
7 | 301054642211530 |
oct | 35652464404571 |
9 | 7228646065201 |
10 | 2050122451321 |
11 | 7204a774a37a |
12 | 2913b1a3b761 |
13 | 11b4307a89a9 |
14 | 71325577317 |
15 | 384dd4ae431 |
hex | 1dd54d20979 |
2050122451321 has 8 divisors (see below), whose sum is σ = 2480820445440. Its totient is φ = 1653880296768.
The previous prime is 2050122451301. The next prime is 2050122451361. The reversal of 2050122451321 is 1231542210502.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2050122451321 - 217 = 2050122320249 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2050122451321.
It is not an unprimeable number, because it can be changed into a prime (2050122451301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8613959761 + ... + 8613959998.
It is an arithmetic number, because the mean of its divisors is an integer number (310102555680).
Almost surely, 22050122451321 is an apocalyptic number.
It is an amenable number.
2050122451321 is a deficient number, since it is larger than the sum of its proper divisors (430697994119).
2050122451321 is a wasteful number, since it uses less digits than its factorization.
2050122451321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17227919783.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 2050122451321 its reverse (1231542210502), we get a palindrome (3281664661823).
The spelling of 2050122451321 in words is "two trillion, fifty billion, one hundred twenty-two million, four hundred fifty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •