Base | Representation |
---|---|
bin | 10000100110000111101… |
… | …001011100111101101111 |
3 | 11001000200101001112112111 |
4 | 100212013221130331233 |
5 | 122141111140433033 |
6 | 2231524544344451 |
7 | 145252135053010 |
oct | 20460751347557 |
9 | 4030611045474 |
10 | 1140442124143 |
11 | 3aa727936493 |
12 | 165037915127 |
13 | 8370a62a74a |
14 | 3d2aa683007 |
15 | 1e9eb1bc7cd |
hex | 10987a5cf6f |
1140442124143 has 8 divisors (see below), whose sum is σ = 1305538329600. Its totient is φ = 975889894200.
The previous prime is 1140442124137. The next prime is 1140442124203. The reversal of 1140442124143 is 3414212440411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1140442124143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140442124113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135989383 + ... + 135997768.
It is an arithmetic number, because the mean of its divisors is an integer number (163192291200).
Almost surely, 21140442124143 is an apocalyptic number.
1140442124143 is a deficient number, since it is larger than the sum of its proper divisors (165096205457).
1140442124143 is an equidigital number, since it uses as much as digits as its factorization.
1140442124143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271987757.
The product of its (nonzero) digits is 12288, while the sum is 31.
Adding to 1140442124143 its reverse (3414212440411), we get a palindrome (4554654564554).
The spelling of 1140442124143 in words is "one trillion, one hundred forty billion, four hundred forty-two million, one hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •