Base | Representation |
---|---|
bin | 101010000111… |
… | …111001101100 |
3 | 202210000100020 |
4 | 222013321230 |
5 | 10311324122 |
6 | 1032402140 |
7 | 162600423 |
oct | 52077154 |
9 | 22700306 |
10 | 11042412 |
11 | 6262367 |
12 | 3846350 |
13 | 2398194 |
14 | 16762ba |
15 | e81c5c |
hex | a87e6c |
11042412 has 12 divisors (see below), whose sum is σ = 25765656. Its totient is φ = 3680800.
The previous prime is 11042399. The next prime is 11042413. The reversal of 11042412 is 21424011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 11042391 and 11042400.
It is not an unprimeable number, because it can be changed into a prime (11042413) 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 3 ways as a sum of consecutive naturals, for example, 460089 + ... + 460112.
It is an arithmetic number, because the mean of its divisors is an integer number (2147138).
Almost surely, 211042412 is an apocalyptic number.
11042412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11042412 is an abundant number, since it is smaller than the sum of its proper divisors (14723244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11042412 is a wasteful number, since it uses less digits than its factorization.
11042412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920208 (or 920206 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
The square root of 11042412 is about 3323.0124886915. The cubic root of 11042412 is about 222.6834711084.
Adding to 11042412 its reverse (21424011), we get a palindrome (32466423).
The spelling of 11042412 in words is "eleven million, forty-two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •