Base | Representation |
---|---|
bin | 11110010000000… |
… | …000100100111001 |
3 | 1022100222100011011 |
4 | 132100000210321 |
5 | 2014410410040 |
6 | 122205433521 |
7 | 15401535106 |
oct | 3620004471 |
9 | 1270870134 |
10 | 507513145 |
11 | 240529157 |
12 | 121b6b8a1 |
13 | 811b5a49 |
14 | 4b58daad |
15 | 2e84e3ea |
hex | 1e400939 |
507513145 has 4 divisors (see below), whose sum is σ = 609015780. Its totient is φ = 406010512.
The previous prime is 507513131. The next prime is 507513157. The reversal of 507513145 is 541315705.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 240746256 + 266766889 = 15516^2 + 16333^2 .
It is a cyclic number.
It is not a de Polignac number, because 507513145 - 219 = 506988857 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50751310 + ... + 50751319.
It is an arithmetic number, because the mean of its divisors is an integer number (152253945).
Almost surely, 2507513145 is an apocalyptic number.
It is an amenable number.
507513145 is a deficient number, since it is larger than the sum of its proper divisors (101502635).
507513145 is a wasteful number, since it uses less digits than its factorization.
507513145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101502634.
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 507513145 is about 22528.0524013950. The cubic root of 507513145 is about 797.6562365258.
The spelling of 507513145 in words is "five hundred seven million, five hundred thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •