Base | Representation |
---|---|
bin | 101010010100111… |
… | …0111111011010001 |
3 | 10122222110211201211 |
4 | 1110221313323101 |
5 | 10402041404441 |
6 | 352533100121 |
7 | 50124015544 |
oct | 12451677321 |
9 | 3588424654 |
10 | 1420263121 |
11 | 669779782 |
12 | 337787641 |
13 | 1983248a4 |
14 | d68a885b |
15 | 84a48a81 |
hex | 54a77ed1 |
1420263121 has 2 divisors, whose sum is σ = 1420263122. Its totient is φ = 1420263120.
The previous prime is 1420263043. The next prime is 1420263127. The reversal of 1420263121 is 1213620241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1250612496 + 169650625 = 35364^2 + 13025^2 .
It is an emirp because it is prime and its reverse (1213620241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1420263121 - 213 = 1420254929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1420263092 and 1420263101.
It is not a weakly prime, because it can be changed into another prime (1420263127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 710131560 + 710131561.
It is an arithmetic number, because the mean of its divisors is an integer number (710131561).
Almost surely, 21420263121 is an apocalyptic number.
It is an amenable number.
1420263121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1420263121 is an equidigital number, since it uses as much as digits as its factorization.
1420263121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 1420263121 is about 37686.3784542904. The cubic root of 1420263121 is about 1124.0602841765.
Adding to 1420263121 its reverse (1213620241), we get a palindrome (2633883362).
The spelling of 1420263121 in words is "one billion, four hundred twenty million, two hundred sixty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •