Base | Representation |
---|---|
bin | 10000010011001100011… |
… | …111001001001010011101 |
3 | 10222002020020120002201200 |
4 | 100103030133021022131 |
5 | 121323002241304041 |
6 | 2214324350230113 |
7 | 143632446500430 |
oct | 20231437111235 |
9 | 3862206502650 |
10 | 1120122213021 |
11 | 3a204a873509 |
12 | 1611067b5339 |
13 | 8181c8a31b6 |
14 | 3c2ddac3817 |
15 | 1e20c30d1b6 |
hex | 104cc7c929d |
1120122213021 has 24 divisors (see below), whose sum is σ = 1849166102784. Its totient is φ = 640043713440.
The previous prime is 1120122212959. The next prime is 1120122213037. The reversal of 1120122213021 is 1203122210211.
It is not a de Polignac number, because 1120122213021 - 218 = 1120121950877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120122212985 and 1120122213003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120122213121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1249515 + ... + 1949751.
It is an arithmetic number, because the mean of its divisors is an integer number (77048587616).
Almost surely, 21120122213021 is an apocalyptic number.
It is an amenable number.
1120122213021 is a deficient number, since it is larger than the sum of its proper divisors (729043889763).
1120122213021 is a wasteful number, since it uses less digits than its factorization.
1120122213021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725641 (or 725638 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1120122213021 its reverse (1203122210211), we get a palindrome (2323244423232).
The spelling of 1120122213021 in words is "one trillion, one hundred twenty billion, one hundred twenty-two million, two hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •