Base | Representation |
---|---|
bin | 101011100101… |
… | …100011100110 |
3 | 210111111120000 |
4 | 223211203212 |
5 | 10411113042 |
6 | 1044522130 |
7 | 166056006 |
oct | 53454346 |
9 | 23444500 |
10 | 11426022 |
11 | 64a45a3 |
12 | 39b0346 |
13 | 24a097a |
14 | 1736006 |
15 | 100a74c |
hex | ae58e6 |
11426022 has 40 divisors (see below), whose sum is σ = 25796232. Its totient is φ = 3780000.
The previous prime is 11426021. The next prime is 11426053. The reversal of 11426022 is 22062411.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11425986 and 11426004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11426021) 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 19 ways as a sum of consecutive naturals, for example, 40522 + ... + 40802.
Almost surely, 211426022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11426022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12898116).
11426022 is an abundant number, since it is smaller than the sum of its proper divisors (14370210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11426022 is a wasteful number, since it uses less digits than its factorization.
11426022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546 (or 537 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 11426022 is about 3380.2399323125. The cubic root of 11426022 is about 225.2328256601.
Adding to 11426022 its reverse (22062411), we get a palindrome (33488433).
The spelling of 11426022 in words is "eleven million, four hundred twenty-six thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •