Base | Representation |
---|---|
bin | 111110000000111… |
… | …110011100000101 |
3 | 2200111202222200011 |
4 | 332000332130011 |
5 | 4112323140031 |
6 | 251124150221 |
7 | 34532422633 |
oct | 7600763405 |
9 | 2614688604 |
10 | 1040443141 |
11 | 494337371 |
12 | 250538371 |
13 | 13772a63a |
14 | 9c278353 |
15 | 6151e6b1 |
hex | 3e03e705 |
1040443141 has 2 divisors, whose sum is σ = 1040443142. Its totient is φ = 1040443140.
The previous prime is 1040443139. The next prime is 1040443147. The reversal of 1040443141 is 1413440401.
1040443141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 888636100 + 151807041 = 29810^2 + 12321^2 .
It is a cyclic number.
It is not a de Polignac number, because 1040443141 - 21 = 1040443139 is a prime.
Together with 1040443139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1040443147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520221570 + 520221571.
It is an arithmetic number, because the mean of its divisors is an integer number (520221571).
Almost surely, 21040443141 is an apocalyptic number.
It is an amenable number.
1040443141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040443141 is an equidigital number, since it uses as much as digits as its factorization.
1040443141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 1040443141 is about 32255.9008710034. The cubic root of 1040443141 is about 1013.3032848195.
Adding to 1040443141 its reverse (1413440401), we get a palindrome (2453883542).
The spelling of 1040443141 in words is "one billion, forty million, four hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •