Base | Representation |
---|---|
bin | 111110000100010… |
… | …101000000011101 |
3 | 2200120102122020222 |
4 | 332010111000131 |
5 | 4113034301023 |
6 | 251155051125 |
7 | 34543043144 |
oct | 7604250035 |
9 | 2616378228 |
10 | 1041322013 |
11 | 494887706 |
12 | 2508a0aa5 |
13 | 137977694 |
14 | 9c42675b |
15 | 61644cc8 |
hex | 3e11501d |
1041322013 has 16 divisors (see below), whose sum is σ = 1078684992. Its totient is φ = 1004640000.
The previous prime is 1041322003. The next prime is 1041322027. The reversal of 1041322013 is 3102231401.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1041322013 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1041321982 and 1041322000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041322003) 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 in 15 ways as a sum of consecutive naturals, for example, 2258603 + ... + 2259063.
It is an arithmetic number, because the mean of its divisors is an integer number (67417812).
Almost surely, 21041322013 is an apocalyptic number.
It is an amenable number.
1041322013 is a deficient number, since it is larger than the sum of its proper divisors (37362979).
1041322013 is a wasteful number, since it uses less digits than its factorization.
1041322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1036.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1041322013 is about 32269.5214250227. The cubic root of 1041322013 is about 1013.5885200913.
Adding to 1041322013 its reverse (3102231401), we get a palindrome (4143553414).
The spelling of 1041322013 in words is "one billion, forty-one million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •