Base | Representation |
---|---|
bin | 111111100000110… |
… | …010110100101101 |
3 | 2202021001010102122 |
4 | 333200302310231 |
5 | 4140240431024 |
6 | 253422402325 |
7 | 35256056654 |
oct | 7740626455 |
9 | 2667033378 |
10 | 1065561389 |
11 | 4a7533052 |
12 | 258a303a5 |
13 | 13c9b35c9 |
14 | a173619b |
15 | 63831d5e |
hex | 3f832d2d |
1065561389 has 2 divisors, whose sum is σ = 1065561390. Its totient is φ = 1065561388.
The previous prime is 1065561383. The next prime is 1065561391. The reversal of 1065561389 is 9831655601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 913852900 + 151708489 = 30230^2 + 12317^2 .
It is a cyclic number.
It is not a de Polignac number, because 1065561389 - 216 = 1065495853 is a prime.
It is a super-2 number, since 2×10655613892 = 2270842147455218642, which contains 22 as substring.
Together with 1065561391, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1065561383) 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, 532780694 + 532780695.
It is an arithmetic number, because the mean of its divisors is an integer number (532780695).
Almost surely, 21065561389 is an apocalyptic number.
It is an amenable number.
1065561389 is a deficient number, since it is larger than the sum of its proper divisors (1).
1065561389 is an equidigital number, since it uses as much as digits as its factorization.
1065561389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 44.
The square root of 1065561389 is about 32642.9378120291. The cubic root of 1065561389 is about 1021.3928776007.
The spelling of 1065561389 in words is "one billion, sixty-five million, five hundred sixty-one thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •