Base | Representation |
---|---|
bin | 10101100001010… |
… | …110101001010001 |
3 | 221011102000010022 |
4 | 111201112221101 |
5 | 1214413040131 |
6 | 55454513225 |
7 | 11643000521 |
oct | 2541265121 |
9 | 834360108 |
10 | 361065041 |
11 | 1758a2567 |
12 | a0b05815 |
13 | 59a5b76c |
14 | 35d4b681 |
15 | 21a7237b |
hex | 15856a51 |
361065041 has 2 divisors, whose sum is σ = 361065042. Its totient is φ = 361065040.
The previous prime is 361064959. The next prime is 361065043. The reversal of 361065041 is 140560163.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 191961025 + 169104016 = 13855^2 + 13004^2 .
It is a cyclic number.
It is not a de Polignac number, because 361065041 - 210 = 361064017 is a prime.
It is a Sophie Germain prime.
Together with 361065043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 361065041.
It is not a weakly prime, because it can be changed into another prime (361065043) 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, 180532520 + 180532521.
It is an arithmetic number, because the mean of its divisors is an integer number (180532521).
Almost surely, 2361065041 is an apocalyptic number.
It is an amenable number.
361065041 is a deficient number, since it is larger than the sum of its proper divisors (1).
361065041 is an equidigital number, since it uses as much as digits as its factorization.
361065041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 361065041 is about 19001.7115281756. The cubic root of 361065041 is about 712.0794956319.
The spelling of 361065041 in words is "three hundred sixty-one million, sixty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •