Base | Representation |
---|---|
bin | 10100110000010111… |
… | …11111010100000101 |
3 | 1001202120220221101021 |
4 | 22120023333110011 |
5 | 140310130324331 |
6 | 5041421431141 |
7 | 543065521240 |
oct | 123013772405 |
9 | 31676827337 |
10 | 11143214341 |
11 | 47a9065956 |
12 | 21aba0b4b1 |
13 | 10877bba6c |
14 | 779d10257 |
15 | 45342d211 |
hex | 2982ff505 |
11143214341 has 8 divisors (see below), whose sum is σ = 12858744704. Its totient is φ = 9458594640.
The previous prime is 11143214323. The next prime is 11143214353. The reversal of 11143214341 is 14341234111.
11143214341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11143214341 - 221 = 11141117189 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 (11143214311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7726890 + ... + 7728331.
It is an arithmetic number, because the mean of its divisors is an integer number (1607343088).
Almost surely, 211143214341 is an apocalyptic number.
It is an amenable number.
11143214341 is a deficient number, since it is larger than the sum of its proper divisors (1715530363).
11143214341 is a wasteful number, since it uses less digits than its factorization.
11143214341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15455331.
The product of its digits is 1152, while the sum is 25.
Adding to 11143214341 its reverse (14341234111), we get a palindrome (25484448452).
The spelling of 11143214341 in words is "eleven billion, one hundred forty-three million, two hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •