Base | Representation |
---|---|
bin | 10110110111010110010100… |
… | …00111001100010111001101 |
3 | 20121000202012000202102212202 |
4 | 23123223022013030113031 |
5 | 23042243002140102003 |
6 | 254534235120411245 |
7 | 13406426106506636 |
oct | 1333531207142715 |
9 | 217022160672782 |
10 | 50280278050253 |
11 | 15025823178669 |
12 | 57807a3476b25 |
13 | 220954365b024 |
14 | c5b81536288d |
15 | 5c2d8abc8088 |
hex | 2dbaca1cc5cd |
50280278050253 has 16 divisors (see below), whose sum is σ = 50548073967600. Its totient is φ = 50013217013760.
The previous prime is 50280278050181. The next prime is 50280278050309. The reversal of 50280278050253 is 35205087208205.
It can be written as a sum of positive squares in 8 ways, for example, as 127636136644 + 50152641913609 = 357262^2 + 7081853^2 .
It is a cyclic number.
It is not a de Polignac number, because 50280278050253 - 220 = 50280277001677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50280278050198 and 50280278050207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50280278050153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2272133093 + ... + 2272155221.
It is an arithmetic number, because the mean of its divisors is an integer number (3159254622975).
Almost surely, 250280278050253 is an apocalyptic number.
It is an amenable number.
50280278050253 is a deficient number, since it is larger than the sum of its proper divisors (267795917347).
50280278050253 is a wasteful number, since it uses less digits than its factorization.
50280278050253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38192.
The product of its (nonzero) digits is 1344000, while the sum is 47.
The spelling of 50280278050253 in words is "fifty trillion, two hundred eighty billion, two hundred seventy-eight million, fifty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •