Base | Representation |
---|---|
bin | 101010001010… |
… | …000110011111 |
3 | 202210110200222 |
4 | 222022012133 |
5 | 10312121143 |
6 | 1032511555 |
7 | 162635615 |
oct | 52120637 |
9 | 22713628 |
10 | 11051423 |
11 | 6269109 |
12 | 384b5bb |
13 | 239c306 |
14 | 16796b5 |
15 | e84768 |
hex | a8a19f |
11051423 has 4 divisors (see below), whose sum is σ = 11099088. Its totient is φ = 11003760.
The previous prime is 11051393. The next prime is 11051429. The reversal of 11051423 is 32415011.
11051423 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, and also an emirpimes, since its reverse is a distinct semiprime: 32415011 = 29 ⋅1117759.
It is a cyclic number.
It is not a de Polignac number, because 11051423 - 28 = 11051167 is a prime.
It is a super-3 number, since 3×110514233 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051429) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23483 + ... + 23948.
It is an arithmetic number, because the mean of its divisors is an integer number (2774772).
Almost surely, 211051423 is an apocalyptic number.
11051423 is a deficient number, since it is larger than the sum of its proper divisors (47665).
11051423 is an equidigital number, since it uses as much as digits as its factorization.
11051423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47664.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 11051423 is about 3324.3680602484. The cubic root of 11051423 is about 222.7440271773.
Adding to 11051423 its reverse (32415011), we get a palindrome (43466434).
The spelling of 11051423 in words is "eleven million, fifty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •