Base | Representation |
---|---|
bin | 10100101100100010… |
… | …10111101010000111 |
3 | 1001200100102212002211 |
4 | 22112101113222013 |
5 | 140223413222333 |
6 | 5034312444251 |
7 | 542225353042 |
oct | 122621275207 |
9 | 31610385084 |
10 | 11111070343 |
11 | 4791a0066a |
12 | 21a10a9687 |
13 | 1080c45c49 |
14 | 775943c59 |
15 | 4506cdecd |
hex | 296457a87 |
11111070343 has 4 divisors (see below), whose sum is σ = 11235913920. Its totient is φ = 10986226768.
The previous prime is 11111070329. The next prime is 11111070367. The reversal of 11111070343 is 34307011111.
11111070343 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 a de Polignac number, because none of the positive numbers 2k-11111070343 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 (11111070143) 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, 62421655 + ... + 62421832.
It is an arithmetic number, because the mean of its divisors is an integer number (2808978480).
Almost surely, 211111070343 is an apocalyptic number.
11111070343 is a deficient number, since it is larger than the sum of its proper divisors (124843577).
11111070343 is an equidigital number, since it uses as much as digits as its factorization.
11111070343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124843576.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 11111070343 its reverse (34307011111), we get a palindrome (45418081454).
The spelling of 11111070343 in words is "eleven billion, one hundred eleven million, seventy thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •