Base | Representation |
---|---|
bin | 101010110100… |
… | …011000110111 |
3 | 210010021022002 |
4 | 222310120313 |
5 | 10333142011 |
6 | 1040325515 |
7 | 164256605 |
oct | 52643067 |
9 | 23107262 |
10 | 11224631 |
11 | 6377260 |
12 | 391389b |
13 | 24300c2 |
14 | 16c2875 |
15 | ebac3b |
hex | ab4637 |
11224631 has 8 divisors (see below), whose sum is σ = 12365184. Its totient is φ = 10104120.
The previous prime is 11224613. The next prime is 11224637. The reversal of 11224631 is 13642211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11224631 is a prime.
It is a super-2 number, since 2×112246312 = 251984682172322, which contains 22 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 (11224637) 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 7 ways as a sum of consecutive naturals, for example, 3821 + ... + 6086.
It is an arithmetic number, because the mean of its divisors is an integer number (1545648).
Almost surely, 211224631 is an apocalyptic number.
11224631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11224631 is a deficient number, since it is larger than the sum of its proper divisors (1140553).
11224631 is a wasteful number, since it uses less digits than its factorization.
11224631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10021.
The product of its digits is 288, while the sum is 20.
The square root of 11224631 is about 3350.3180446041. The cubic root of 11224631 is about 223.9016827780.
Adding to 11224631 its reverse (13642211), we get a palindrome (24866842).
The spelling of 11224631 in words is "eleven million, two hundred twenty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •