Base | Representation |
---|---|
bin | 11110101010000… |
… | …010001010101001 |
3 | 1022211210221112022 |
4 | 132222002022221 |
5 | 2023132213101 |
6 | 123011554225 |
7 | 15513531056 |
oct | 3652021251 |
9 | 1284727468 |
10 | 514335401 |
11 | 244368888 |
12 | 1242bb975 |
13 | 82734098 |
14 | 4c44802d |
15 | 3024aa1b |
hex | 1ea822a9 |
514335401 has 8 divisors (see below), whose sum is σ = 521108424. Its totient is φ = 507606400.
The previous prime is 514335383. The next prime is 514335413. The reversal of 514335401 is 104533415.
It can be written as a sum of positive squares in 4 ways, for example, as 311557801 + 202777600 = 17651^2 + 14240^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 514335401 - 210 = 514334377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (514335421) 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, 12851 + ... + 34551.
It is an arithmetic number, because the mean of its divisors is an integer number (65138553).
Almost surely, 2514335401 is an apocalyptic number.
It is an amenable number.
514335401 is a deficient number, since it is larger than the sum of its proper divisors (6773023).
514335401 is a wasteful number, since it uses less digits than its factorization.
514335401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22011.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 514335401 is about 22678.9638431741. The cubic root of 514335401 is about 801.2145099614.
Adding to 514335401 its reverse (104533415), we get a palindrome (618868816).
The spelling of 514335401 in words is "five hundred fourteen million, three hundred thirty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •