Base | Representation |
---|---|
bin | 111111001101000… |
… | …100100010000001 |
3 | 2201220022110001021 |
4 | 333031010202001 |
5 | 4132430003131 |
6 | 253115505441 |
7 | 35164114033 |
oct | 7715044201 |
9 | 2656273037 |
10 | 1060391041 |
11 | 4a4621536 |
12 | 257158281 |
13 | 13b8c3128 |
14 | a0b8bc53 |
15 | 6315ee11 |
hex | 3f344881 |
1060391041 has 2 divisors, whose sum is σ = 1060391042. Its totient is φ = 1060391040.
The previous prime is 1060391027. The next prime is 1060391063. The reversal of 1060391041 is 1401930601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 918090000 + 142301041 = 30300^2 + 11929^2 .
It is a cyclic number.
It is not a de Polignac number, because 1060391041 - 221 = 1058293889 is a prime.
It is a super-2 number, since 2×10603910412 = 2248858319666127362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1060390997 and 1060391015.
It is not a weakly prime, because it can be changed into another prime (1060391071) 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, 530195520 + 530195521.
It is an arithmetic number, because the mean of its divisors is an integer number (530195521).
Almost surely, 21060391041 is an apocalyptic number.
It is an amenable number.
1060391041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1060391041 is an equidigital number, since it uses as much as digits as its factorization.
1060391041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 1060391041 is about 32563.6460028664. The cubic root of 1060391041 is about 1019.7381876420.
The spelling of 1060391041 in words is "one billion, sixty million, three hundred ninety-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •