Base | Representation |
---|---|
bin | 100010101100110… |
… | …1001000001100101 |
3 | 10000010221002022002 |
4 | 1011121221001211 |
5 | 4341033141131 |
6 | 311312015045 |
7 | 40565544035 |
oct | 10531510145 |
9 | 3003832262 |
10 | 1164349541 |
11 | 548277053 |
12 | 285b31485 |
13 | 1572c1634 |
14 | b08cd8c5 |
15 | 6c3476cb |
hex | 45669065 |
1164349541 has 2 divisors, whose sum is σ = 1164349542. Its totient is φ = 1164349540.
The previous prime is 1164349457. The next prime is 1164349577. The reversal of 1164349541 is 1459434611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 904204900 + 260144641 = 30070^2 + 16129^2 .
It is an emirp because it is prime and its reverse (1459434611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1164349541 - 210 = 1164348517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1164349495 and 1164349504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1164349591) 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, 582174770 + 582174771.
It is an arithmetic number, because the mean of its divisors is an integer number (582174771).
Almost surely, 21164349541 is an apocalyptic number.
It is an amenable number.
1164349541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1164349541 is an equidigital number, since it uses as much as digits as its factorization.
1164349541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 38.
The square root of 1164349541 is about 34122.5664480267. The cubic root of 1164349541 is about 1052.0291948916.
The spelling of 1164349541 in words is "one billion, one hundred sixty-four million, three hundred forty-nine thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •