Base | Representation |
---|---|
bin | 101010011100011… |
… | …1100101111101101 |
3 | 10200020220121201111 |
4 | 1110320330233231 |
5 | 10404044340041 |
6 | 353153512021 |
7 | 50202425245 |
oct | 12470745755 |
9 | 3606817644 |
10 | 1424215021 |
11 | 670a28909 |
12 | 338b72611 |
13 | 1990a95a8 |
14 | d7216b25 |
15 | 85079981 |
hex | 54e3cbed |
1424215021 has 2 divisors, whose sum is σ = 1424215022. Its totient is φ = 1424215020.
The previous prime is 1424214949. The next prime is 1424215031. The reversal of 1424215021 is 1205124241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 965655625 + 458559396 = 31075^2 + 21414^2 .
It is a cyclic number.
It is not a de Polignac number, because 1424215021 - 219 = 1423690733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1424214983 and 1424215001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1424215031) 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, 712107510 + 712107511.
It is an arithmetic number, because the mean of its divisors is an integer number (712107511).
Almost surely, 21424215021 is an apocalyptic number.
It is an amenable number.
1424215021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1424215021 is an equidigital number, since it uses as much as digits as its factorization.
1424215021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 22.
The square root of 1424215021 is about 37738.7734432374. The cubic root of 1424215021 is about 1125.1018893068.
Adding to 1424215021 its reverse (1205124241), we get a palindrome (2629339262).
The spelling of 1424215021 in words is "one billion, four hundred twenty-four million, two hundred fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •