Base | Representation |
---|---|
bin | 1010011111110110011110… |
… | …1010010010001011111111 |
3 | 1111212102201212101020101012 |
4 | 2213331213222102023333 |
5 | 3003102130430342033 |
6 | 40314244503105435 |
7 | 2300622233305442 |
oct | 247754752221377 |
9 | 44772655336335 |
10 | 11542316262143 |
11 | 3750083693487 |
12 | 1364b8a44227b |
13 | 6595884714a4 |
14 | 2bc918829659 |
15 | 150397309248 |
hex | a7f67a922ff |
11542316262143 has 8 divisors (see below), whose sum is σ = 11637617971200. Its totient is φ = 11447387554680.
The previous prime is 11542316262089. The next prime is 11542316262151. The reversal of 11542316262143 is 34126261324511.
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 11542316262143 - 212 = 11542316258047 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 11542316262143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11542316262443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93188255 + ... + 93312032.
It is an arithmetic number, because the mean of its divisors is an integer number (1454702246400).
Almost surely, 211542316262143 is an apocalyptic number.
11542316262143 is a deficient number, since it is larger than the sum of its proper divisors (95301709057).
11542316262143 is a wasteful number, since it uses less digits than its factorization.
11542316262143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186500797.
The product of its digits is 207360, while the sum is 41.
Adding to 11542316262143 its reverse (34126261324511), we get a palindrome (45668577586654).
The spelling of 11542316262143 in words is "eleven trillion, five hundred forty-two billion, three hundred sixteen million, two hundred sixty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •