Base | Representation |
---|---|
bin | 100001011000010… |
… | …0010111001010101 |
3 | 2220001112000111001 |
4 | 1002300202321111 |
5 | 4243211201401 |
6 | 303045543301 |
7 | 36520013362 |
oct | 10260427125 |
9 | 2801460431 |
10 | 1120022101 |
11 | 525250200 |
12 | 273114b31 |
13 | 14b071193 |
14 | a8a71469 |
15 | 684dd601 |
hex | 42c22e55 |
1120022101 has 18 divisors (see below), whose sum is σ = 1307816930. Its totient is φ = 958277760.
The previous prime is 1120022083. The next prime is 1120022131. The reversal of 1120022101 is 1012200211.
It can be written as a sum of positive squares in 3 ways, for example, as 112911876 + 1007110225 = 10626^2 + 31735^2 .
It is not a de Polignac number, because 1120022101 - 25 = 1120022069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120022131) 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 17 ways as a sum of consecutive naturals, for example, 18955 + ... + 50983.
Almost surely, 21120022101 is an apocalyptic number.
1120022101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1120022101 is a deficient number, since it is larger than the sum of its proper divisors (187794829).
1120022101 is a wasteful number, since it uses less digits than its factorization.
1120022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32085 (or 32057 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1120022101 is about 33466.7312565778. The cubic root of 1120022101 is about 1038.5056512367.
Adding to 1120022101 its reverse (1012200211), we get a palindrome (2132222312).
The spelling of 1120022101 in words is "one billion, one hundred twenty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •