Base | Representation |
---|---|
bin | 10001111101110… |
… | …100111111110001 |
3 | 210000011202020022 |
4 | 101331310333301 |
5 | 1104130424104 |
6 | 45524253225 |
7 | 10320014024 |
oct | 2175647761 |
9 | 700152208 |
10 | 301420529 |
11 | 145164783 |
12 | 84b41215 |
13 | 4a5a7557 |
14 | 2c0631bb |
15 | 1b6debbe |
hex | 11f74ff1 |
301420529 has 2 divisors, whose sum is σ = 301420530. Its totient is φ = 301420528.
The previous prime is 301420517. The next prime is 301420531. The reversal of 301420529 is 925024103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 283989904 + 17430625 = 16852^2 + 4175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-301420529 is a prime.
It is a Sophie Germain prime.
Together with 301420531, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 301420498 and 301420507.
It is not a weakly prime, because it can be changed into another prime (301420429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150710264 + 150710265.
It is an arithmetic number, because the mean of its divisors is an integer number (150710265).
Almost surely, 2301420529 is an apocalyptic number.
It is an amenable number.
301420529 is a deficient number, since it is larger than the sum of its proper divisors (1).
301420529 is an equidigital number, since it uses as much as digits as its factorization.
301420529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 301420529 is about 17361.4667871122. The cubic root of 301420529 is about 670.4878966490.
The spelling of 301420529 in words is "three hundred one million, four hundred twenty thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •