Base | Representation |
---|---|
bin | 111110000000111… |
… | …110101011100011 |
3 | 2200111210001000211 |
4 | 332000332223203 |
5 | 4112323203011 |
6 | 251124154551 |
7 | 34532425546 |
oct | 7600765343 |
9 | 2614701024 |
10 | 1040444131 |
11 | 494338091 |
12 | 250538a57 |
13 | 13772ac1c |
14 | 9c27885d |
15 | 6151eb21 |
hex | 3e03eae3 |
1040444131 has 8 divisors (see below), whose sum is σ = 1052337440. Its totient is φ = 1028593728.
The previous prime is 1040444129. The next prime is 1040444137. The reversal of 1040444131 is 1314440401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1040444131 - 21 = 1040444129 is a prime.
It is a super-2 number, since 2×10404441312 = 2165047979464690322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1040444137) 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 in 7 ways as a sum of consecutive naturals, for example, 39370 + ... + 60256.
It is an arithmetic number, because the mean of its divisors is an integer number (131542180).
Almost surely, 21040444131 is an apocalyptic number.
1040444131 is a deficient number, since it is larger than the sum of its proper divisors (11893309).
1040444131 is a wasteful number, since it uses less digits than its factorization.
1040444131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21453.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 1040444131 is about 32255.9162170291. The cubic root of 1040444131 is about 1013.3036062114.
Adding to 1040444131 its reverse (1314440401), we get a palindrome (2354884532).
The spelling of 1040444131 in words is "one billion, forty million, four hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •