Base | Representation |
---|---|
bin | 111110000011001… |
… | …100010000001101 |
3 | 2200112212111110221 |
4 | 332003030100031 |
5 | 4113000232023 |
6 | 251144431341 |
7 | 34540362301 |
oct | 7603142015 |
9 | 2615774427 |
10 | 1041024013 |
11 | 4946a3827 |
12 | 250778551 |
13 | 1378a1b53 |
14 | 9c389d01 |
15 | 615d685d |
hex | 3e0cc40d |
1041024013 has 2 divisors, whose sum is σ = 1041024014. Its totient is φ = 1041024012.
The previous prime is 1041023983. The next prime is 1041024029. The reversal of 1041024013 is 3104201401.
It is an a-pointer prime, because the next prime (1041024029) can be obtained adding 1041024013 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 962116324 + 78907689 = 31018^2 + 8883^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041024013 - 229 = 504153101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1041024613) 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, 520512006 + 520512007.
It is an arithmetic number, because the mean of its divisors is an integer number (520512007).
Almost surely, 21041024013 is an apocalyptic number.
It is an amenable number.
1041024013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1041024013 is an equidigital number, since it uses as much as digits as its factorization.
1041024013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1041024013 is about 32264.9037345534. The cubic root of 1041024013 is about 1013.4918230745.
Adding to 1041024013 its reverse (3104201401), we get a palindrome (4145225414).
The spelling of 1041024013 in words is "one billion, forty-one million, twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •