Base | Representation |
---|---|
bin | 1010001100100101111000… |
… | …1010010011111110101111 |
3 | 1110200210200211121022220221 |
4 | 2203021132022103332233 |
5 | 2432142014231413033 |
6 | 35502244430552211 |
7 | 2235000021025144 |
oct | 243113612237657 |
9 | 43623624538827 |
10 | 11211444404143 |
11 | 36328240a2355 |
12 | 1310a2a068667 |
13 | 6343087584a9 |
14 | 2aa8cb56a3cb |
15 | 14697e70312d |
hex | a325e293faf |
11211444404143 has 2 divisors, whose sum is σ = 11211444404144. Its totient is φ = 11211444404142.
The previous prime is 11211444404023. The next prime is 11211444404177. The reversal of 11211444404143 is 34140444411211.
It is an a-pointer prime, because the next prime (11211444404177) can be obtained adding 11211444404143 to its sum of digits (34).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11211444404143 - 29 = 11211444403631 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11211444404099 and 11211444404108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11211444204143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605722202071 + 5605722202072.
It is an arithmetic number, because the mean of its divisors is an integer number (5605722202072).
Almost surely, 211211444404143 is an apocalyptic number.
11211444404143 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211444404143 is an equidigital number, since it uses as much as digits as its factorization.
11211444404143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 34.
Adding to 11211444404143 its reverse (34140444411211), we get a palindrome (45351888815354).
The spelling of 11211444404143 in words is "eleven trillion, two hundred eleven billion, four hundred forty-four million, four hundred four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •