Base | Representation |
---|---|
bin | 100001011010111… |
… | …1010101110010101 |
3 | 2220011011120100001 |
4 | 1002311322232111 |
5 | 4244041233141 |
6 | 303140051301 |
7 | 36535000306 |
oct | 10265725625 |
9 | 2804146301 |
10 | 1121430421 |
11 | 526022301 |
12 | 273693b31 |
13 | 14b4451c7 |
14 | a8d1a7ad |
15 | 686baa31 |
hex | 42d7ab95 |
1121430421 has 2 divisors, whose sum is σ = 1121430422. Its totient is φ = 1121430420.
The previous prime is 1121430413. The next prime is 1121430439. The reversal of 1121430421 is 1240341211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 625700196 + 495730225 = 25014^2 + 22265^2 .
It is an emirp because it is prime and its reverse (1240341211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121430421 - 23 = 1121430413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121430451) 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, 560715210 + 560715211.
It is an arithmetic number, because the mean of its divisors is an integer number (560715211).
Almost surely, 21121430421 is an apocalyptic number.
It is an amenable number.
1121430421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121430421 is an equidigital number, since it uses as much as digits as its factorization.
1121430421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 1121430421 is about 33487.7652434438. The cubic root of 1121430421 is about 1038.9407425624.
Adding to 1121430421 its reverse (1240341211), we get a palindrome (2361771632).
The spelling of 1121430421 in words is "one billion, one hundred twenty-one million, four hundred thirty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •