Base | Representation |
---|---|
bin | 101010010101010… |
… | …0011001010011101 |
3 | 10122222210211200002 |
4 | 1110222203022131 |
5 | 10402113041341 |
6 | 352540544045 |
7 | 50125354064 |
oct | 12452431235 |
9 | 3588724602 |
10 | 1420440221 |
11 | 66988a842 |
12 | 337852025 |
13 | 198387395 |
14 | d69131db |
15 | 84a8129b |
hex | 54aa329d |
1420440221 has 2 divisors, whose sum is σ = 1420440222. Its totient is φ = 1420440220.
The previous prime is 1420440173. The next prime is 1420440257. The reversal of 1420440221 is 1220440241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1373517721 + 46922500 = 37061^2 + 6850^2 .
It is a cyclic number.
It is not a de Polignac number, because 1420440221 - 218 = 1420178077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1420440193 and 1420440202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1420440521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 710220110 + 710220111.
It is an arithmetic number, because the mean of its divisors is an integer number (710220111).
Almost surely, 21420440221 is an apocalyptic number.
It is an amenable number.
1420440221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1420440221 is an equidigital number, since it uses as much as digits as its factorization.
1420440221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 20.
The square root of 1420440221 is about 37688.7280363771. The cubic root of 1420440221 is about 1124.1070038769.
Adding to 1420440221 its sum of digits (20), we get a palindrome (1420440241).
Adding to 1420440221 its reverse (1220440241), we get a palindrome (2640880462).
The spelling of 1420440221 in words is "one billion, four hundred twenty million, four hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •