Base | Representation |
---|---|
bin | 111110010000001… |
… | …110110011111001 |
3 | 2200210022011120102 |
4 | 332100032303321 |
5 | 4114334123421 |
6 | 251350005145 |
7 | 34611420314 |
oct | 7620166371 |
9 | 2623264512 |
10 | 1044442361 |
11 | 496619006 |
12 | 2519467b5 |
13 | 1384caa41 |
14 | 9c9d997b |
15 | 61a5e60b |
hex | 3e40ecf9 |
1044442361 has 2 divisors, whose sum is σ = 1044442362. Its totient is φ = 1044442360.
The previous prime is 1044442349. The next prime is 1044442363. The reversal of 1044442361 is 1632444401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 780867136 + 263575225 = 27944^2 + 16235^2 .
It is a cyclic number.
It is not a de Polignac number, because 1044442361 - 210 = 1044441337 is a prime.
It is a Sophie Germain prime.
Together with 1044442363, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1044442363) 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, 522221180 + 522221181.
It is an arithmetic number, because the mean of its divisors is an integer number (522221181).
Almost surely, 21044442361 is an apocalyptic number.
It is an amenable number.
1044442361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1044442361 is an equidigital number, since it uses as much as digits as its factorization.
1044442361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 29.
The square root of 1044442361 is about 32317.8334824598. The cubic root of 1044442361 is about 1014.5999251561.
Adding to 1044442361 its reverse (1632444401), we get a palindrome (2676886762).
The spelling of 1044442361 in words is "one billion, forty-four million, four hundred forty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •