Base | Representation |
---|---|
bin | 110000111010001… |
… | …1001000110010001 |
3 | 11020101001202020022 |
4 | 1201310121012101 |
5 | 11330111433431 |
6 | 430502553225 |
7 | 55445216531 |
oct | 14164310621 |
9 | 4211052208 |
10 | 1641124241 |
11 | 77240aa29 |
12 | 399738815 |
13 | 202004243 |
14 | 117d5b4c1 |
15 | 9912407b |
hex | 61d19191 |
1641124241 has 2 divisors, whose sum is σ = 1641124242. Its totient is φ = 1641124240.
The previous prime is 1641124231. The next prime is 1641124249. The reversal of 1641124241 is 1424211461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 883278400 + 757845841 = 29720^2 + 27529^2 .
It is an emirp because it is prime and its reverse (1424211461) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1641124241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1641124241.
It is not a weakly prime, because it can be changed into another prime (1641124249) 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, 820562120 + 820562121.
It is an arithmetic number, because the mean of its divisors is an integer number (820562121).
Almost surely, 21641124241 is an apocalyptic number.
It is an amenable number.
1641124241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1641124241 is an equidigital number, since it uses as much as digits as its factorization.
1641124241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1536, while the sum is 26.
The square root of 1641124241 is about 40510.7916609883. The cubic root of 1641124241 is about 1179.5431155184.
The spelling of 1641124241 in words is "one billion, six hundred forty-one million, one hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •