Base | Representation |
---|---|
bin | 101010010011100… |
… | …0110101001010101 |
3 | 10122221002221122202 |
4 | 1110213012221111 |
5 | 10401400140411 |
6 | 352505334245 |
7 | 50114602532 |
oct | 12447065125 |
9 | 3587087582 |
10 | 1419536981 |
11 | 669323165 |
12 | 337497385 |
13 | 19812c215 |
14 | d6759d89 |
15 | 8495383b |
hex | 549c6a55 |
1419536981 has 2 divisors, whose sum is σ = 1419536982. Its totient is φ = 1419536980.
The previous prime is 1419536969. The next prime is 1419536983. The reversal of 1419536981 is 1896359141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1268000881 + 151536100 = 35609^2 + 12310^2 .
It is an emirp because it is prime and its reverse (1896359141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1419536981 - 226 = 1352428117 is a prime.
It is a super-2 number, since 2×14195369812 = 4030170480853188722, which contains 22 as substring.
Together with 1419536983, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1419536983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 709768490 + 709768491.
It is an arithmetic number, because the mean of its divisors is an integer number (709768491).
Almost surely, 21419536981 is an apocalyptic number.
It is an amenable number.
1419536981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1419536981 is an equidigital number, since it uses as much as digits as its factorization.
1419536981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 233280, while the sum is 47.
The square root of 1419536981 is about 37676.7432377057. The cubic root of 1419536981 is about 1123.8686848720.
The spelling of 1419536981 in words is "one billion, four hundred nineteen million, five hundred thirty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •