Base | Representation |
---|---|
bin | 10100111001101010… |
… | …01000110101101100 |
3 | 1001222000111110022021 |
4 | 22130311020311230 |
5 | 140440101010444 |
6 | 5053243155524 |
7 | 545032601530 |
oct | 123465106554 |
9 | 31860443267 |
10 | 11221110124 |
11 | 483902a134 |
12 | 2211b15ba4 |
13 | 109a993443 |
14 | 7863c9bc0 |
15 | 45a1b8584 |
hex | 29cd48d6c |
11221110124 has 12 divisors (see below), whose sum is σ = 22442220304. Its totient is φ = 4809047184.
The previous prime is 11221110031. The next prime is 11221110191. The reversal of 11221110124 is 42101112211.
11221110124 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
11221110124 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11221110098 and 11221110107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 200376939 + ... + 200376994.
Almost surely, 211221110124 is an apocalyptic number.
11221110124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11221110124 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221110124 is a wasteful number, since it uses less digits than its factorization.
11221110124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400753944 (or 400753942 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11221110124 its reverse (42101112211), we get a palindrome (53322222335).
The spelling of 11221110124 in words is "eleven billion, two hundred twenty-one million, one hundred ten thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •