Base | Representation |
---|---|
bin | 100001111110011… |
… | …0011000110100111 |
3 | 2221110010120200121 |
4 | 1003330303012213 |
5 | 4313320331211 |
6 | 305042222411 |
7 | 40151636326 |
oct | 10374630647 |
9 | 2843116617 |
10 | 1140011431 |
11 | 535563509 |
12 | 279954a07 |
13 | 15224c7a0 |
14 | ab5960bd |
15 | 6a13b271 |
hex | 43f331a7 |
1140011431 has 8 divisors (see below), whose sum is σ = 1270039680. Its totient is φ = 1016031072.
The previous prime is 1140011407. The next prime is 1140011501. The reversal of 1140011431 is 1341100411.
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 1140011431 - 27 = 1140011303 is a prime.
It is a super-2 number, since 2×11400114312 = 2599252125621335522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140011531) 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, 1511575 + ... + 1512328.
It is an arithmetic number, because the mean of its divisors is an integer number (158754960).
Almost surely, 21140011431 is an apocalyptic number.
1140011431 is a deficient number, since it is larger than the sum of its proper divisors (130028249).
1140011431 is a wasteful number, since it uses less digits than its factorization.
1140011431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3023945.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1140011431 is about 33764.0553103445. The cubic root of 1140011431 is about 1044.6474184261.
Adding to 1140011431 its reverse (1341100411), we get a palindrome (2481111842).
The spelling of 1140011431 in words is "one billion, one hundred forty million, eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •