Base | Representation |
---|---|
bin | 10101001000000110… |
… | …00110010111101111 |
3 | 1002021110100222211222 |
4 | 22210003012113233 |
5 | 141212101214133 |
6 | 5113250533555 |
7 | 551033125136 |
oct | 124403062757 |
9 | 32243328758 |
10 | 11342210543 |
11 | 48a0422724 |
12 | 22465972bb |
13 | 10b9ab41b1 |
14 | 79851091d |
15 | 465b39e98 |
hex | 2a40c65ef |
11342210543 has 4 divisors (see below), whose sum is σ = 11423809320. Its totient is φ = 11260611768.
The previous prime is 11342210533. The next prime is 11342210549. The reversal of 11342210543 is 34501224311.
It is a happy number.
11342210543 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11342210543 - 26 = 11342210479 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 (11342210549) 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 3 ways as a sum of consecutive naturals, for example, 40799180 + ... + 40799457.
It is an arithmetic number, because the mean of its divisors is an integer number (2855952330).
Almost surely, 211342210543 is an apocalyptic number.
11342210543 is a deficient number, since it is larger than the sum of its proper divisors (81598777).
11342210543 is an equidigital number, since it uses as much as digits as its factorization.
11342210543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81598776.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 11342210543 its reverse (34501224311), we get a palindrome (45843434854).
The spelling of 11342210543 in words is "eleven billion, three hundred forty-two million, two hundred ten thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •