Base | Representation |
---|---|
bin | 101010001011… |
… | …010011010111 |
3 | 202210201110012 |
4 | 222023103113 |
5 | 10312300333 |
6 | 1032550435 |
7 | 162656144 |
oct | 52132327 |
9 | 22721405 |
10 | 11056343 |
11 | 6271881 |
12 | 385241b |
13 | 23a161c |
14 | 167b3cb |
15 | e85e48 |
hex | a8b4d7 |
11056343 has 4 divisors (see below), whose sum is σ = 11079000. Its totient is φ = 11033688.
The previous prime is 11056321. The next prime is 11056387. The reversal of 11056343 is 34365011.
It is a happy number.
11056343 is digitally balanced in base 3, 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, and also an emirpimes, since its reverse is a distinct semiprime: 34365011 = 41 ⋅838171.
It is a cyclic number.
It is not a de Polignac number, because 11056343 - 222 = 6862039 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 (11026343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10580 + ... + 11577.
It is an arithmetic number, because the mean of its divisors is an integer number (2769750).
Almost surely, 211056343 is an apocalyptic number.
11056343 is a deficient number, since it is larger than the sum of its proper divisors (22657).
11056343 is an equidigital number, since it uses as much as digits as its factorization.
11056343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22656.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 11056343 is about 3325.1079681719. The cubic root of 11056343 is about 222.7770768586. Note that the first 3 decimals are identical.
The spelling of 11056343 in words is "eleven million, fifty-six thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •