Base | Representation |
---|---|
bin | 100001011010011… |
… | …0001111001101111 |
3 | 2220010121102011201 |
4 | 1002310301321233 |
5 | 4244002212033 |
6 | 303125430331 |
7 | 36532315555 |
oct | 10264617157 |
9 | 2803542151 |
10 | 1121132143 |
11 | 52593919a |
12 | 27356b3a7 |
13 | 14b36c501 |
14 | a8c7dbd5 |
15 | 6865c47d |
hex | 42d31e6f |
1121132143 has 8 divisors (see below), whose sum is σ = 1158506496. Its totient is φ = 1083833400.
The previous prime is 1121132119. The next prime is 1121132189. The reversal of 1121132143 is 3412311211.
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 1121132143 - 213 = 1121123951 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121132143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121132743) 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, 12078 + ... + 48868.
It is an arithmetic number, because the mean of its divisors is an integer number (144813312).
Almost surely, 21121132143 is an apocalyptic number.
1121132143 is a deficient number, since it is larger than the sum of its proper divisors (37374353).
1121132143 is an equidigital number, since it uses as much as digits as its factorization.
1121132143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37805.
The product of its digits is 144, while the sum is 19.
The square root of 1121132143 is about 33483.3114103130. The cubic root of 1121132143 is about 1038.8486219278.
Adding to 1121132143 its reverse (3412311211), we get a palindrome (4533443354).
The spelling of 1121132143 in words is "one billion, one hundred twenty-one million, one hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •