Base | Representation |
---|---|
bin | 111110000000100… |
… | …011000110000111 |
3 | 2200111120022001002 |
4 | 332000203012013 |
5 | 4112311044033 |
6 | 251121523515 |
7 | 34531445255 |
oct | 7600430607 |
9 | 2614508032 |
10 | 1040331143 |
11 | 494270205 |
12 | 2504a359b |
13 | 1376bb677 |
14 | 9c2495d5 |
15 | 614eb3e8 |
hex | 3e023187 |
1040331143 has 4 divisors (see below), whose sum is σ = 1040788320. Its totient is φ = 1039873968.
The previous prime is 1040331119. The next prime is 1040331151. The reversal of 1040331143 is 3411330401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3411330401 = 4639 ⋅735359.
It is a cyclic number.
It is not a de Polignac number, because 1040331143 - 210 = 1040330119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040331113) 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 3 ways as a sum of consecutive naturals, for example, 225158 + ... + 229731.
It is an arithmetic number, because the mean of its divisors is an integer number (260197080).
Almost surely, 21040331143 is an apocalyptic number.
1040331143 is a deficient number, since it is larger than the sum of its proper divisors (457177).
1040331143 is an equidigital number, since it uses as much as digits as its factorization.
1040331143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457176.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1040331143 is about 32254.1647388364. The cubic root of 1040331143 is about 1013.2669246670.
Adding to 1040331143 its reverse (3411330401), we get a palindrome (4451661544).
The spelling of 1040331143 in words is "one billion, forty million, three hundred thirty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •