Base | Representation |
---|---|
bin | 10100101101110110… |
… | …01001011010001001 |
3 | 1001201010001020222200 |
4 | 22112323021122021 |
5 | 140234214201100 |
6 | 5035343310413 |
7 | 542420425122 |
oct | 122673113211 |
9 | 31633036880 |
10 | 11122022025 |
11 | 4798100844 |
12 | 21a48ab409 |
13 | 10832aba2a |
14 | 777195049 |
15 | 451643e00 |
hex | 296ec9689 |
11122022025 has 144 divisors (see below), whose sum is σ = 21475863552. Its totient is φ = 5488560000.
The previous prime is 11122022011. The next prime is 11122022027. The reversal of 11122022025 is 52022022111.
11122022025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11122022025 - 28 = 11122021769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11122021989 and 11122022007.
It is not an unprimeable number, because it can be changed into a prime (11122022027) by changing a digit.
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 143 ways as a sum of consecutive naturals, for example, 33601110 + ... + 33601440.
Almost surely, 211122022025 is an apocalyptic number.
11122022025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11122022025 is a deficient number, since it is larger than the sum of its proper divisors (10353841527).
11122022025 is a wasteful number, since it uses less digits than its factorization.
11122022025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564 (or 556 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 11122022025 its reverse (52022022111), we get a palindrome (63144044136).
The spelling of 11122022025 in words is "eleven billion, one hundred twenty-two million, twenty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •