Base | Representation |
---|---|
bin | 101010110101… |
… | …100100110100 |
3 | 210010111222010 |
4 | 222311210310 |
5 | 10333320432 |
6 | 1040404220 |
7 | 164310021 |
oct | 52654464 |
9 | 23114863 |
10 | 11229492 |
11 | 637a97a |
12 | 3916670 |
13 | 2432391 |
14 | 16c4548 |
15 | ebc3cc |
hex | ab5934 |
11229492 has 12 divisors (see below), whose sum is σ = 26202176. Its totient is φ = 3743160.
The previous prime is 11229461. The next prime is 11229509. The reversal of 11229492 is 29492211.
It is a happy number.
11229492 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-3 number, since 3×112294923 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 467884 + ... + 467907.
Almost surely, 211229492 is an apocalyptic number.
11229492 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11229492 is an abundant number, since it is smaller than the sum of its proper divisors (14972684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11229492 is a wasteful number, since it uses less digits than its factorization.
11229492 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 935798 (or 935796 counting only the distinct ones).
The product of its digits is 2592, while the sum is 30.
The square root of 11229492 is about 3351.0434195934. The cubic root of 11229492 is about 223.9339994752.
It can be divided in two parts, 11 and 229492, that added together give a triangular number (229503 = T677).
The spelling of 11229492 in words is "eleven million, two hundred twenty-nine thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •