Base | Representation |
---|---|
bin | 1001011010001100… |
… | …01001010101101101 |
3 | 111001001101111011111 |
4 | 10231012021111231 |
5 | 40321144200013 |
6 | 2153132152021 |
7 | 236116331104 |
oct | 45506112555 |
9 | 14031344144 |
10 | 5051553133 |
11 | 2162519700 |
12 | b8b908611 |
13 | 62673bbc3 |
14 | 35cc8103b |
15 | 1e873b73d |
hex | 12d18956d |
5051553133 has 12 divisors (see below), whose sum is σ = 5687966844. Its totient is φ = 4480308800.
The previous prime is 5051553103. The next prime is 5051553173. The reversal of 5051553133 is 3313551505.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1500942564 + 3550610569 = 38742^2 + 59587^2 .
It is a de Polignac number, because none of the positive numbers 2k-5051553133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5051553095 and 5051553104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5051553103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 504166 + ... + 514087.
It is an arithmetic number, because the mean of its divisors is an integer number (473997237).
Almost surely, 25051553133 is an apocalyptic number.
It is an amenable number.
5051553133 is a deficient number, since it is larger than the sum of its proper divisors (636413711).
5051553133 is a wasteful number, since it uses less digits than its factorization.
5051553133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1018316 (or 1018305 counting only the distinct ones).
The product of its (nonzero) digits is 16875, while the sum is 31.
The square root of 5051553133 is about 71074.2789833284. The cubic root of 5051553133 is about 1715.8328376504.
The spelling of 5051553133 in words is "five billion, fifty-one million, five hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •