Base | Representation |
---|---|
bin | 1010001100100100001111… |
… | …0111000001110000010111 |
3 | 1110200202120002021211212212 |
4 | 2203021003313001300113 |
5 | 2432140113301004033 |
6 | 35502132545104035 |
7 | 2234653052245121 |
oct | 243110367016027 |
9 | 43622502254785 |
10 | 11211003141143 |
11 | 3632618003993 |
12 | 131092632801b |
13 | 6342681ca520 |
14 | 2aa888b04211 |
15 | 146955add748 |
hex | a3243dc1c17 |
11211003141143 has 8 divisors (see below), whose sum is σ = 12184153027200. Its totient is φ = 10253676830688.
The previous prime is 11211003141113. The next prime is 11211003141167. The reversal of 11211003141143 is 34114130011211.
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 11211003141143 - 220 = 11211002092567 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 (11211003141113) 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, 3955892423 + ... + 3955895256.
It is an arithmetic number, because the mean of its divisors is an integer number (1523019128400).
Almost surely, 211211003141143 is an apocalyptic number.
11211003141143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11211003141143 is a deficient number, since it is larger than the sum of its proper divisors (973149886057).
11211003141143 is a wasteful number, since it uses less digits than its factorization.
11211003141143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7911787801.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 11211003141143 its reverse (34114130011211), we get a palindrome (45325133152354).
The spelling of 11211003141143 in words is "eleven trillion, two hundred eleven billion, three million, one hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •