Base | Representation |
---|---|
bin | 10011011111100011111011 |
3 | 100121121121200 |
4 | 103133203323 |
5 | 2302010021 |
6 | 301305243 |
7 | 61301664 |
oct | 23374373 |
9 | 10547550 |
10 | 5110011 |
11 | 2980255 |
12 | 1865223 |
13 | 109bb9a |
14 | 97036b |
15 | 6ae126 |
hex | 4df8fb |
5110011 has 6 divisors (see below), whose sum is σ = 7381140. Its totient is φ = 3406668.
The previous prime is 5109989. The next prime is 5110019. The reversal of 5110011 is 1100115.
It is not a de Polignac number, because 5110011 - 27 = 5109883 is a prime.
It is a super-2 number, since 2×51100112 = 52224424840242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 567779 = 5110011 / (5 + 1 + 1 + 0 + 0 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 5109975 and 5110002.
It is not an unprimeable number, because it can be changed into a prime (5110019) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 283881 + ... + 283898.
It is an arithmetic number, because the mean of its divisors is an integer number (1230190).
Almost surely, 25110011 is an apocalyptic number.
5110011 is a deficient number, since it is larger than the sum of its proper divisors (2271129).
5110011 is a wasteful number, since it uses less digits than its factorization.
5110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567785 (or 567782 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
The square root of 5110011 is about 2260.5333441469. The cubic root of 5110011 is about 172.2426155216.
Adding to 5110011 its reverse (1100115), we get a palindrome (6210126).
It can be divided in two parts, 5 and 110011, that multiplied together give a palindrome (550055).
The spelling of 5110011 in words is "five million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •