Base | Representation |
---|---|
bin | 1110110110001000110… |
… | …1011001100001100101 |
3 | 220101022220222112200001 |
4 | 3231202031121201211 |
5 | 13134320443000203 |
6 | 313100234421301 |
7 | 24266252414401 |
oct | 3554215314145 |
9 | 811286875601 |
10 | 255050750053 |
11 | 99191554550 |
12 | 4151bb91831 |
13 | 1b0885a93a8 |
14 | c4b7524101 |
15 | 697b44791d |
hex | 3b62359865 |
255050750053 has 24 divisors (see below), whose sum is σ = 297369463680. Its totient is φ = 216880148160.
The previous prime is 255050750047. The next prime is 255050750063. The reversal of 255050750053 is 350057050552.
255050750053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 255050750053 - 213 = 255050741861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 255050749994 and 255050750021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255050750033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 92800 + ... + 720217.
It is an arithmetic number, because the mean of its divisors is an integer number (12390394320).
Almost surely, 2255050750053 is an apocalyptic number.
It is an amenable number.
255050750053 is a deficient number, since it is larger than the sum of its proper divisors (42318713627).
255050750053 is a wasteful number, since it uses less digits than its factorization.
255050750053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813145 (or 813126 counting only the distinct ones).
The product of its (nonzero) digits is 131250, while the sum is 37.
The spelling of 255050750053 in words is "two hundred fifty-five billion, fifty million, seven hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •