Base | Representation |
---|---|
bin | 100010000010101… |
… | …0011001101110001 |
3 | 2221121022210212101 |
4 | 1010011103031301 |
5 | 4314403140423 |
6 | 305202100401 |
7 | 40206611050 |
oct | 10405231561 |
9 | 2847283771 |
10 | 1142240113 |
11 | 5368459a3 |
12 | 27a64a701 |
13 | 152850031 |
14 | ab9b6397 |
15 | 6a42b7ad |
hex | 44153371 |
1142240113 has 4 divisors (see below), whose sum is σ = 1305417280. Its totient is φ = 979062948.
The previous prime is 1142240101. The next prime is 1142240123. The reversal of 1142240113 is 3110422411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1142240113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1142240123) 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, 81588573 + ... + 81588586.
It is an arithmetic number, because the mean of its divisors is an integer number (326354320).
Almost surely, 21142240113 is an apocalyptic number.
It is an amenable number.
1142240113 is a deficient number, since it is larger than the sum of its proper divisors (163177167).
1142240113 is an equidigital number, since it uses as much as digits as its factorization.
1142240113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163177166.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 1142240113 is about 33797.0429623658. The cubic root of 1142240113 is about 1045.3277248703.
Adding to 1142240113 its reverse (3110422411), we get a palindrome (4252662524).
The spelling of 1142240113 in words is "one billion, one hundred forty-two million, two hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •