Base | Representation |
---|---|
bin | 11110100101001… |
… | …110011101011001 |
3 | 1022202102220122000 |
4 | 132211032131121 |
5 | 2022321400113 |
6 | 122524551213 |
7 | 15500031402 |
oct | 3645163531 |
9 | 1282386560 |
10 | 513075033 |
11 | 243687959 |
12 | 1239b2509 |
13 | 823b24c3 |
14 | 4c1da9a9 |
15 | 3009c373 |
hex | 1e94e759 |
513075033 has 48 divisors (see below), whose sum is σ = 795450240. Its totient is φ = 326705184.
The previous prime is 513075023. The next prime is 513075071. The reversal of 513075033 is 330570315.
It is not a de Polignac number, because 513075033 - 217 = 512943961 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 513074988 and 513075006.
It is not an unprimeable number, because it can be changed into a prime (513075023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4981260 + ... + 4981362.
It is an arithmetic number, because the mean of its divisors is an integer number (16571880).
Almost surely, 2513075033 is an apocalyptic number.
513075033 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
513075033 is a deficient number, since it is larger than the sum of its proper divisors (282375207).
513075033 is a wasteful number, since it uses less digits than its factorization.
513075033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283 (or 218 counting only the distinct ones).
The product of its (nonzero) digits is 4725, while the sum is 27.
The square root of 513075033 is about 22651.1596391885. The cubic root of 513075033 is about 800.5595215991.
The spelling of 513075033 in words is "five hundred thirteen million, seventy-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •