Base | Representation |
---|---|
bin | 1001100001001100… |
… | …10000000111001101 |
3 | 111012010221012021100 |
4 | 10300212100013031 |
5 | 40431214114013 |
6 | 2203031253313 |
7 | 240431562060 |
oct | 46046200715 |
9 | 14163835240 |
10 | 5110301133 |
11 | 21926a4973 |
12 | ba751a239 |
13 | 63596b032 |
14 | 3669b48d7 |
15 | 1ed993473 |
hex | 1309901cd |
5110301133 has 48 divisors (see below), whose sum is σ = 8953027200. Its totient is φ = 2742018048.
The previous prime is 5110301111. The next prime is 5110301137. The reversal of 5110301133 is 3311030115.
It is not a de Polignac number, because 5110301133 - 25 = 5110301101 is a prime.
It is a super-2 number, since 2×51103011332 = 52230355339882167378, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110301137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 475566 + ... + 486192.
It is an arithmetic number, because the mean of its divisors is an integer number (186521400).
Almost surely, 25110301133 is an apocalyptic number.
It is an amenable number.
5110301133 is a deficient number, since it is larger than the sum of its proper divisors (3842726067).
5110301133 is a wasteful number, since it uses less digits than its factorization.
5110301133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11106 (or 11103 counting only the distinct ones).
The product of its (nonzero) digits is 135, while the sum is 18.
The square root of 5110301133 is about 71486.3702603510. The cubic root of 5110301133 is about 1722.4587528769.
Adding to 5110301133 its reverse (3311030115), we get a palindrome (8421331248).
The spelling of 5110301133 in words is "five billion, one hundred ten million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •