Base | Representation |
---|---|
bin | 10011000111011001011011 |
3 | 100102120211220 |
4 | 103013121123 |
5 | 2240323120 |
6 | 255223123 |
7 | 60410301 |
oct | 23073133 |
9 | 10376756 |
10 | 5011035 |
11 | 2912957 |
12 | 1817aa3 |
13 | 1065b13 |
14 | 946271 |
15 | 68eb40 |
hex | 4c765b |
5011035 has 8 divisors (see below), whose sum is σ = 8017680. Its totient is φ = 2672544.
The previous prime is 5011031. The next prime is 5011043. The reversal of 5011035 is 5301105.
5011035 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5011035 - 22 = 5011031 is a prime.
It is a super-2 number, since 2×50110352 = 50220943542450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 334069 = 5011035 / (5 + 0 + 1 + 1 + 0 + 3 + 5).
It is not an unprimeable number, because it can be changed into a prime (5011031) 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 7 ways as a sum of consecutive naturals, for example, 167020 + ... + 167049.
It is an arithmetic number, because the mean of its divisors is an integer number (1002210).
Almost surely, 25011035 is an apocalyptic number.
5011035 is a deficient number, since it is larger than the sum of its proper divisors (3006645).
5011035 is a wasteful number, since it uses less digits than its factorization.
5011035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334077.
The product of its (nonzero) digits is 75, while the sum is 15.
The square root of 5011035 is about 2238.5341185696. The cubic root of 5011035 is about 171.1232994666.
The spelling of 5011035 in words is "five million, eleven thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •