Base | Representation |
---|---|
bin | 101010011101000… |
… | …1010110111011001 |
3 | 10200021111212122121 |
4 | 1110322022313121 |
5 | 10404140110001 |
6 | 353204421241 |
7 | 50205230161 |
oct | 12472126731 |
9 | 3607455577 |
10 | 1424535001 |
11 | 67112725a |
12 | 3390a7821 |
13 | 19918c126 |
14 | d729b5a1 |
15 | 850de6a1 |
hex | 54e8add9 |
1424535001 has 2 divisors, whose sum is σ = 1424535002. Its totient is φ = 1424535000.
The previous prime is 1424534989. The next prime is 1424535017. The reversal of 1424535001 is 1005354241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1304654400 + 119880601 = 36120^2 + 10949^2 .
It is an emirp because it is prime and its reverse (1005354241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1424535001 - 219 = 1424010713 is a prime.
It is not a weakly prime, because it can be changed into another prime (1424533001) 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 as a sum of consecutive naturals, namely, 712267500 + 712267501.
It is an arithmetic number, because the mean of its divisors is an integer number (712267501).
Almost surely, 21424535001 is an apocalyptic number.
It is an amenable number.
1424535001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1424535001 is an equidigital number, since it uses as much as digits as its factorization.
1424535001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 1424535001 is about 37743.0126116080. The cubic root of 1424535001 is about 1125.1861423021.
Adding to 1424535001 its reverse (1005354241), we get a palindrome (2429889242).
The spelling of 1424535001 in words is "one billion, four hundred twenty-four million, five hundred thirty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •