Base | Representation |
---|---|
bin | 111101100001001… |
… | …100101101110011 |
3 | 2122221002202212211 |
4 | 331201030231303 |
5 | 4103210104021 |
6 | 250225432551 |
7 | 34401546556 |
oct | 7541145563 |
9 | 2587082784 |
10 | 1032113011 |
11 | 48a667866 |
12 | 24979b757 |
13 | 135aa1b77 |
14 | 9b10a69d |
15 | 609263e1 |
hex | 3d84cb73 |
1032113011 has 2 divisors, whose sum is σ = 1032113012. Its totient is φ = 1032113010.
The previous prime is 1032112981. The next prime is 1032113023. The reversal of 1032113011 is 1103112301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1032113011 is a prime.
It is a super-2 number, since 2×10321130112 = 2130514534950972242, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1032112982 and 1032113000.
It is not a weakly prime, because it can be changed into another prime (1032113081) 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, 516056505 + 516056506.
It is an arithmetic number, because the mean of its divisors is an integer number (516056506).
Almost surely, 21032113011 is an apocalyptic number.
1032113011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032113011 is an equidigital number, since it uses as much as digits as its factorization.
1032113011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1032113011 is about 32126.5156996522. The cubic root of 1032113011 is about 1010.5917556329.
Adding to 1032113011 its reverse (1103112301), we get a palindrome (2135225312).
It can be divided in two parts, 10321 and 13011, that added together give a palindrome (23332).
The spelling of 1032113011 in words is "one billion, thirty-two million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •