Base | Representation |
---|---|
bin | 10000010011001110011… |
… | …101000010000110001101 |
3 | 10222002022112122201212100 |
4 | 100103032131002012031 |
5 | 121323034213323341 |
6 | 2214331525425313 |
7 | 143633330136021 |
oct | 20231635020615 |
9 | 3862275581770 |
10 | 1120155214221 |
11 | 3a206746382a |
12 | 16111586b239 |
13 | 81826689234 |
14 | 3c304234381 |
15 | 1e21017b3b6 |
hex | 104ce74218d |
1120155214221 has 12 divisors (see below), whose sum is σ = 1626941215900. Its totient is φ = 742644339840.
The previous prime is 1120155214187. The next prime is 1120155214231. The reversal of 1120155214221 is 1224125510211.
1120155214221 is a `hidden beast` number, since 1 + 120 + 15 + 521 + 4 + 2 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 33111261225 + 1087043952996 = 181965^2 + 1042614^2 .
It is not a de Polignac number, because 1120155214221 - 234 = 1102975345037 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 (1120155214231) 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 11 ways as a sum of consecutive naturals, for example, 343815196 + ... + 343818453.
Almost surely, 21120155214221 is an apocalyptic number.
It is an amenable number.
1120155214221 is a deficient number, since it is larger than the sum of its proper divisors (506786001679).
1120155214221 is a wasteful number, since it uses less digits than its factorization.
1120155214221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 687633836 (or 687633833 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 27.
The spelling of 1120155214221 in words is "one trillion, one hundred twenty billion, one hundred fifty-five million, two hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •