Base | Representation |
---|---|
bin | 11001101001000… |
… | …101100010101001 |
3 | 1002222111110211102 |
4 | 121221011202221 |
5 | 1340112413001 |
6 | 110404411145 |
7 | 13442435216 |
oct | 3151054251 |
9 | 1088443742 |
10 | 430201001 |
11 | 20092341a |
12 | 1000a6ab5 |
13 | 6b186c09 |
14 | 411c6b0d |
15 | 27b7be6b |
hex | 19a458a9 |
430201001 has 2 divisors, whose sum is σ = 430201002. Its totient is φ = 430201000.
The previous prime is 430200977. The next prime is 430201007. The reversal of 430201001 is 100102034.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 396965776 + 33235225 = 19924^2 + 5765^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-430201001 is a prime.
It is a super-2 number, since 2×4302010012 = 370145802522804002, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (430201007) 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 as a sum of consecutive naturals, namely, 215100500 + 215100501.
It is an arithmetic number, because the mean of its divisors is an integer number (215100501).
Almost surely, 2430201001 is an apocalyptic number.
It is an amenable number.
430201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
430201001 is an equidigital number, since it uses as much as digits as its factorization.
430201001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 430201001 is about 20741.2873515604. The cubic root of 430201001 is about 754.9018196089.
Adding to 430201001 its reverse (100102034), we get a palindrome (530303035).
The spelling of 430201001 in words is "four hundred thirty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •