Base | Representation |
---|---|
bin | 111001110110110… |
… | …0100101100110001 |
3 | 12000021221121111201 |
4 | 1303231210230301 |
5 | 12433434423031 |
6 | 520345211201 |
7 | 66052001302 |
oct | 16355445461 |
9 | 5007847451 |
10 | 1941326641 |
11 | 906912491 |
12 | 462190b01 |
13 | 24c2731b7 |
14 | 145b847a9 |
15 | b5672d61 |
hex | 73b64b31 |
1941326641 has 2 divisors, whose sum is σ = 1941326642. Its totient is φ = 1941326640.
The previous prime is 1941326627. The next prime is 1941326687. The reversal of 1941326641 is 1466231491.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1781177616 + 160149025 = 42204^2 + 12655^2 .
It is an emirp because it is prime and its reverse (1466231491) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1941326641 - 221 = 1939229489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1941326641.
It is not a weakly prime, because it can be changed into another prime (1941326141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 970663320 + 970663321.
It is an arithmetic number, because the mean of its divisors is an integer number (970663321).
Almost surely, 21941326641 is an apocalyptic number.
It is an amenable number.
1941326641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1941326641 is an equidigital number, since it uses as much as digits as its factorization.
1941326641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 37.
The square root of 1941326641 is about 44060.4884335160. The cubic root of 1941326641 is about 1247.4779315055.
The spelling of 1941326641 in words is "one billion, nine hundred forty-one million, three hundred twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •