Base | Representation |
---|---|
bin | 101000000100001… |
… | …1111110001010001 |
3 | 10110200201211100112 |
4 | 1100020133301101 |
5 | 10223131421221 |
6 | 341223131105 |
7 | 45213151553 |
oct | 12010376121 |
9 | 3420654315 |
10 | 1344404561 |
11 | 62a977055 |
12 | 3162a3a95 |
13 | 1856b4576 |
14 | ca79d4d3 |
15 | 7d06215b |
hex | 5021fc51 |
1344404561 has 2 divisors, whose sum is σ = 1344404562. Its totient is φ = 1344404560.
The previous prime is 1344404543. The next prime is 1344404563. The reversal of 1344404561 is 1654044431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 853516225 + 490888336 = 29215^2 + 22156^2 .
It is a cyclic number.
It is not a de Polignac number, because 1344404561 - 222 = 1340210257 is a prime.
Together with 1344404563, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1344404563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672202280 + 672202281.
It is an arithmetic number, because the mean of its divisors is an integer number (672202281).
Almost surely, 21344404561 is an apocalyptic number.
It is an amenable number.
1344404561 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344404561 is an equidigital number, since it uses as much as digits as its factorization.
1344404561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 32.
The square root of 1344404561 is about 36666.1227974816. The cubic root of 1344404561 is about 1103.6803889205.
Adding to 1344404561 its reverse (1654044431), we get a palindrome (2998448992).
The spelling of 1344404561 in words is "one billion, three hundred forty-four million, four hundred four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •