Base | Representation |
---|---|
bin | 11101110111101… |
… | …010101101010001 |
3 | 1021220222011000122 |
4 | 131313222231101 |
5 | 2011242211423 |
6 | 121421000025 |
7 | 15263360366 |
oct | 3567525521 |
9 | 1256864018 |
10 | 501132113 |
11 | 23796aa79 |
12 | 11b9b3015 |
13 | 7ca904a1 |
14 | 4a7ac46d |
15 | 2dedd8c8 |
hex | 1ddeab51 |
501132113 has 8 divisors (see below), whose sum is σ = 505377600. Its totient is φ = 496896048.
The previous prime is 501132101. The next prime is 501132131. The reversal of 501132113 is 311231105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 501132113 - 218 = 500869969 is a prime.
It is a super-2 number, since 2×5011321132 = 502266789359689538, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 501132091 and 501132100.
It is not an unprimeable number, because it can be changed into a prime (501132133) 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, 139028 + ... + 142586.
It is an arithmetic number, because the mean of its divisors is an integer number (63172200).
Almost surely, 2501132113 is an apocalyptic number.
It is an amenable number.
501132113 is a deficient number, since it is larger than the sum of its proper divisors (4245487).
501132113 is a wasteful number, since it uses less digits than its factorization.
501132113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4711.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 501132113 is about 22385.9802778435. The cubic root of 501132113 is about 794.2991135544.
Adding to 501132113 its reverse (311231105), we get a palindrome (812363218).
The spelling of 501132113 in words is "five hundred one million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •