Base | Representation |
---|---|
bin | 110000111010000… |
… | …1100001010110001 |
3 | 11020100222001120211 |
4 | 1201310030022301 |
5 | 11330103240111 |
6 | 430501504121 |
7 | 55444606243 |
oct | 14164141261 |
9 | 4210861524 |
10 | 1641071281 |
11 | 772384163 |
12 | 399712041 |
13 | 201cb60c5 |
14 | 117d46093 |
15 | 99113521 |
hex | 61d0c2b1 |
1641071281 has 2 divisors, whose sum is σ = 1641071282. Its totient is φ = 1641071280.
The previous prime is 1641071233. The next prime is 1641071309. The reversal of 1641071281 is 1821701461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1638954256 + 2117025 = 40484^2 + 1455^2 .
It is an emirp because it is prime and its reverse (1821701461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1641071281 - 229 = 1104200369 is a prime.
It is a super-2 number, since 2×16410712812 = 5386229898645961922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1641071381) 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, 820535640 + 820535641.
It is an arithmetic number, because the mean of its divisors is an integer number (820535641).
Almost surely, 21641071281 is an apocalyptic number.
It is an amenable number.
1641071281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1641071281 is an equidigital number, since it uses as much as digits as its factorization.
1641071281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 31.
The square root of 1641071281 is about 40510.1380027272. The cubic root of 1641071281 is about 1179.5304272092.
The spelling of 1641071281 in words is "one billion, six hundred forty-one million, seventy-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •