Base | Representation |
---|---|
bin | 101010011100011… |
… | …1001110100011101 |
3 | 10200020220000021122 |
4 | 1110320321310131 |
5 | 10404043444122 |
6 | 353153340325 |
7 | 50202345305 |
oct | 12470716435 |
9 | 3606800248 |
10 | 1424203037 |
11 | 670a1a904 |
12 | 338b676a5 |
13 | 1990a3cba |
14 | d7212605 |
15 | 85076142 |
hex | 54e39d1d |
1424203037 has 2 divisors, whose sum is σ = 1424203038. Its totient is φ = 1424203036.
The previous prime is 1424202971. The next prime is 1424203057. The reversal of 1424203037 is 7303024241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1344028921 + 80174116 = 36661^2 + 8954^2 .
It is a cyclic number.
It is not a de Polignac number, because 1424203037 - 28 = 1424202781 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1424202997 and 1424203015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1424203057) 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, 712101518 + 712101519.
It is an arithmetic number, because the mean of its divisors is an integer number (712101519).
Almost surely, 21424203037 is an apocalyptic number.
It is an amenable number.
1424203037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1424203037 is an equidigital number, since it uses as much as digits as its factorization.
1424203037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 26.
The square root of 1424203037 is about 37738.6146672079. The cubic root of 1424203037 is about 1125.0987335897.
Adding to 1424203037 its reverse (7303024241), we get a palindrome (8727227278).
The spelling of 1424203037 in words is "one billion, four hundred twenty-four million, two hundred three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •