Base | Representation |
---|---|
bin | 101010010111… |
… | …010010010111 |
3 | 202220012210021 |
4 | 222113102113 |
5 | 10320333211 |
6 | 1034010011 |
7 | 163252231 |
oct | 52272227 |
9 | 22805707 |
10 | 11105431 |
11 | 62a5747 |
12 | 3876907 |
13 | 23baa7c |
14 | 1691251 |
15 | e95771 |
hex | a97497 |
11105431 has 4 divisors (see below), whose sum is σ = 11113200. Its totient is φ = 11097664.
The previous prime is 11105429. The next prime is 11105441. The reversal of 11105431 is 13450111.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 11105431 - 21 = 11105429 is a prime.
It is a super-3 number, since 3×111054313 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11105411) 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, 1051 + ... + 4828.
It is an arithmetic number, because the mean of its divisors is an integer number (2778300).
Almost surely, 211105431 is an apocalyptic number.
11105431 is a deficient number, since it is larger than the sum of its proper divisors (7769).
11105431 is an equidigital number, since it uses as much as digits as its factorization.
11105431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7768.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 11105431 is about 3332.4812077490. The cubic root of 11105431 is about 223.1062856773.
Adding to 11105431 its reverse (13450111), we get a palindrome (24555542).
The spelling of 11105431 in words is "eleven million, one hundred five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •