Base | Representation |
---|---|
bin | 111110000000111… |
… | …011111111110101 |
3 | 2200111202110221210 |
4 | 332000323333311 |
5 | 4112322330031 |
6 | 251124032033 |
7 | 34532351526 |
oct | 7600737765 |
9 | 2614673853 |
10 | 1040433141 |
11 | 49432a900 |
12 | 250532619 |
13 | 137725c17 |
14 | 9c27484d |
15 | 6151b746 |
hex | 3e03bff5 |
1040433141 has 48 divisors (see below), whose sum is σ = 1632048320. Its totient is φ = 587347200.
The previous prime is 1040433139. The next prime is 1040433143. The reversal of 1040433141 is 1413340401.
It is an interprime number because it is at equal distance from previous prime (1040433139) and next prime (1040433143).
It is not a de Polignac number, because 1040433141 - 21 = 1040433139 is a prime.
It is a super-2 number, since 2×10404331412 = 2165002241782251762, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040433143) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 419481 + ... + 421953.
Almost surely, 21040433141 is an apocalyptic number.
1040433141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1040433141 is a deficient number, since it is larger than the sum of its proper divisors (591615179).
1040433141 is a wasteful number, since it uses less digits than its factorization.
1040433141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2578 (or 2567 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1040433141 is about 32255.7458602340. The cubic root of 1040433141 is about 1013.3000384254.
Adding to 1040433141 its reverse (1413340401), we get a palindrome (2453773542).
The spelling of 1040433141 in words is "one billion, forty million, four hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •