Base | Representation |
---|---|
bin | 11110100101001… |
… | …011110101110001 |
3 | 1022202102100220200 |
4 | 132211023311301 |
5 | 2022321024210 |
6 | 122524425413 |
7 | 15466655205 |
oct | 3645136561 |
9 | 1282370820 |
10 | 513064305 |
11 | 24367a896 |
12 | 1239a8269 |
13 | 823aa660 |
14 | 4c1d6b05 |
15 | 300990c0 |
hex | 1e94bd71 |
513064305 has 48 divisors (see below), whose sum is σ = 959846160. Its totient is φ = 252025344.
The previous prime is 513064297. The next prime is 513064309. The reversal of 513064305 is 503460315.
513064305 is a `hidden beast` number, since 5 + 13 + 0 + 643 + 0 + 5 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 56430144 + 456634161 = 7512^2 + 21369^2 .
It is not a de Polignac number, because 513064305 - 23 = 513064297 is a prime.
It is not an unprimeable number, because it can be changed into a prime (513064309) 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, 414147 + ... + 415383.
It is an arithmetic number, because the mean of its divisors is an integer number (19996795).
Almost surely, 2513064305 is an apocalyptic number.
It is an amenable number.
513064305 is a deficient number, since it is larger than the sum of its proper divisors (446781855).
513064305 is a wasteful number, since it uses less digits than its factorization.
513064305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1970 (or 1967 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 513064305 is about 22650.9228288827. The cubic root of 513064305 is about 800.5539418678.
It can be divided in two parts, 51306 and 4305, that added together give a triangular number (55611 = T333).
The spelling of 513064305 in words is "five hundred thirteen million, sixty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •