Base | Representation |
---|---|
bin | 101010010111000… |
… | …1101111110101101 |
3 | 10200001121201000121 |
4 | 1110232031332231 |
5 | 10402334331104 |
6 | 353013324541 |
7 | 50136501145 |
oct | 12456157655 |
9 | 3601551017 |
10 | 1421402029 |
11 | 66a387423 |
12 | 338036751 |
13 | 1986330b8 |
14 | d6ac3925 |
15 | 84bc1254 |
hex | 54b8dfad |
1421402029 has 2 divisors, whose sum is σ = 1421402030. Its totient is φ = 1421402028.
The previous prime is 1421402009. The next prime is 1421402051. The reversal of 1421402029 is 9202041241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1012957929 + 408444100 = 31827^2 + 20210^2 .
It is an emirp because it is prime and its reverse (9202041241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1421402029 - 25 = 1421401997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1421401994 and 1421402012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1421402009) 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, 710701014 + 710701015.
It is an arithmetic number, because the mean of its divisors is an integer number (710701015).
Almost surely, 21421402029 is an apocalyptic number.
It is an amenable number.
1421402029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1421402029 is an equidigital number, since it uses as much as digits as its factorization.
1421402029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 1421402029 is about 37701.4857664788. The cubic root of 1421402029 is about 1124.3606649501.
The spelling of 1421402029 in words is "one billion, four hundred twenty-one million, four hundred two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •