Base | Representation |
---|---|
bin | 101010111110… |
… | …010110010010 |
3 | 210012100021000 |
4 | 222332112102 |
5 | 10340443201 |
6 | 1041242430 |
7 | 164516544 |
oct | 52762622 |
9 | 23170230 |
10 | 11265426 |
11 | 63a4977 |
12 | 3933416 |
13 | 2445843 |
14 | 16d3694 |
15 | ec7d86 |
hex | abe592 |
11265426 has 32 divisors (see below), whose sum is σ = 25171200. Its totient is φ = 3734640.
The previous prime is 11265421. The next prime is 11265437. The reversal of 11265426 is 62456211.
11265426 is a `hidden beast` number, since 1 + 1 + 2 + 654 + 2 + 6 = 666.
It is a super-2 number, since 2×112654262 = 253819645922952, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 11265426.
It is not an unprimeable number, because it can be changed into a prime (11265421) 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 15 ways as a sum of consecutive naturals, for example, 11911 + ... + 12821.
It is an arithmetic number, because the mean of its divisors is an integer number (786600).
Almost surely, 211265426 is an apocalyptic number.
11265426 is an abundant number, since it is smaller than the sum of its proper divisors (13905774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11265426 is a wasteful number, since it uses less digits than its factorization.
11265426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1151 (or 1145 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 11265426 is about 3356.4007508043. The cubic root of 11265426 is about 224.1726055895.
The spelling of 11265426 in words is "eleven million, two hundred sixty-five thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •