Base | Representation |
---|---|
bin | 111110000100010… |
… | …101101111010101 |
3 | 2200120102210101002 |
4 | 332010111233111 |
5 | 4113034400023 |
6 | 251155113045 |
7 | 34543054661 |
oct | 7604255725 |
9 | 2616383332 |
10 | 1041325013 |
11 | 494889993 |
12 | 2508a2785 |
13 | 137978b61 |
14 | 9c4278a1 |
15 | 61645b28 |
hex | 3e115bd5 |
1041325013 has 2 divisors, whose sum is σ = 1041325014. Its totient is φ = 1041325012.
The previous prime is 1041324989. The next prime is 1041325031. The reversal of 1041325013 is 3105231401.
Together with next prime (1041325031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 751746724 + 289578289 = 27418^2 + 17017^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041325013 - 214 = 1041308629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1041325063) 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, 520662506 + 520662507.
It is an arithmetic number, because the mean of its divisors is an integer number (520662507).
Almost surely, 21041325013 is an apocalyptic number.
It is an amenable number.
1041325013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1041325013 is an equidigital number, since it uses as much as digits as its factorization.
1041325013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 1041325013 is about 32269.5679084800. The cubic root of 1041325013 is about 1013.5894934574.
Adding to 1041325013 its reverse (3105231401), we get a palindrome (4146556414).
The spelling of 1041325013 in words is "one billion, forty-one million, three hundred twenty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •