Base | Representation |
---|---|
bin | 10100110000010111… |
… | …11110100110110011 |
3 | 1001202120220210101221 |
4 | 22120023332212303 |
5 | 140310130231233 |
6 | 5041421405511 |
7 | 543065506630 |
oct | 123013764663 |
9 | 31676823357 |
10 | 11143211443 |
11 | 47a9063761 |
12 | 21aba09897 |
13 | 10877ba650 |
14 | 779d0d187 |
15 | 45342c42d |
hex | 2982fe9b3 |
11143211443 has 8 divisors (see below), whose sum is σ = 13714721888. Its totient is φ = 8816606784.
The previous prime is 11143211437. The next prime is 11143211503. The reversal of 11143211443 is 34411234111.
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 11143211443 - 221 = 11141114291 is a prime.
It is a super-2 number, since 2×111432114432 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11143211743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61226346 + ... + 61226527.
It is an arithmetic number, because the mean of its divisors is an integer number (1714340236).
Almost surely, 211143211443 is an apocalyptic number.
11143211443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11143211443 is a deficient number, since it is larger than the sum of its proper divisors (2571510445).
11143211443 is a wasteful number, since it uses less digits than its factorization.
11143211443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122452893.
The product of its digits is 1152, while the sum is 25.
Adding to 11143211443 its reverse (34411234111), we get a palindrome (45554445554).
The spelling of 11143211443 in words is "eleven billion, one hundred forty-three million, two hundred eleven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •