Base | Representation |
---|---|
bin | 11110101001100… |
… | …111001101101001 |
3 | 1022211121100002102 |
4 | 132221213031221 |
5 | 2023120200001 |
6 | 123005343145 |
7 | 15512561153 |
oct | 3651471551 |
9 | 1284540072 |
10 | 514225001 |
11 | 2442a2944 |
12 | 124267ab5 |
13 | 826c5a64 |
14 | 4c419ad3 |
15 | 30227e6b |
hex | 1ea67369 |
514225001 has 8 divisors (see below), whose sum is σ = 534060360. Its totient is φ = 494702208.
The previous prime is 514224941. The next prime is 514225009. The reversal of 514225001 is 100522415.
It can be written as a sum of positive squares in 4 ways, for example, as 101525776 + 412699225 = 10076^2 + 20315^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-514225001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (514225009) 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 7 ways as a sum of consecutive naturals, for example, 74786 + ... + 81371.
It is an arithmetic number, because the mean of its divisors is an integer number (66757545).
Almost surely, 2514225001 is an apocalyptic number.
It is an amenable number.
514225001 is a deficient number, since it is larger than the sum of its proper divisors (19835359).
514225001 is a wasteful number, since it uses less digits than its factorization.
514225001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156283.
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 514225001 is about 22676.5297389173. The cubic root of 514225001 is about 801.1571800484.
Adding to 514225001 its reverse (100522415), we get a palindrome (614747416).
The spelling of 514225001 in words is "five hundred fourteen million, two hundred twenty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •