Base | Representation |
---|---|
bin | 1111011000101110… |
… | …0001001000010101 |
3 | 101122211201122001111 |
4 | 3312023201020111 |
5 | 31424313330141 |
6 | 1521500455021 |
7 | 204231146314 |
oct | 36613411025 |
9 | 11584648044 |
10 | 4130214421 |
11 | 182a442253 |
12 | 97324a471 |
13 | 50a8b3978 |
14 | 2b276c27b |
15 | 1928e7381 |
hex | f62e1215 |
4130214421 has 2 divisors, whose sum is σ = 4130214422. Its totient is φ = 4130214420.
The previous prime is 4130214419. The next prime is 4130214427. The reversal of 4130214421 is 1244120314.
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., 2892933796 + 1237280625 = 53786^2 + 35175^2 .
It is a cyclic number.
It is not a de Polignac number, because 4130214421 - 21 = 4130214419 is a prime.
Together with 4130214419, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4130214392 and 4130214401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4130214427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2065107210 + 2065107211.
It is an arithmetic number, because the mean of its divisors is an integer number (2065107211).
Almost surely, 24130214421 is an apocalyptic number.
It is an amenable number.
4130214421 is a deficient number, since it is larger than the sum of its proper divisors (1).
4130214421 is an equidigital number, since it uses as much as digits as its factorization.
4130214421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 4130214421 is about 64266.7442850499. The cubic root of 4130214421 is about 1604.4426555741.
Adding to 4130214421 its reverse (1244120314), we get a palindrome (5374334735).
The spelling of 4130214421 in words is "four billion, one hundred thirty million, two hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •