Base | Representation |
---|---|
bin | 10000010100001110100… |
… | …101001110000010101000 |
3 | 10222012002112010111121022 |
4 | 100110032211032002220 |
5 | 121332240130231440 |
6 | 2215030401432012 |
7 | 144002103055313 |
oct | 20241645160250 |
9 | 3865075114538 |
10 | 1121231102120 |
11 | 3a25697aa288 |
12 | 16137603b608 |
13 | 81968546bac |
14 | 3c3a709797a |
15 | 1e27484ccb5 |
hex | 1050e94e0a8 |
1121231102120 has 16 divisors (see below), whose sum is σ = 2522769979860. Its totient is φ = 448492440832.
The previous prime is 1121231102093. The next prime is 1121231102143. The reversal of 1121231102120 is 212011321211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1086777060196 + 34454041924 = 1042486^2 + 185618^2 .
It is a super-2 number, since 2×11212311021202 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14015388737 + ... + 14015388816.
Almost surely, 21121231102120 is an apocalyptic number.
1121231102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121231102120 is an abundant number, since it is smaller than the sum of its proper divisors (1401538877740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121231102120 is a wasteful number, since it uses less digits than its factorization.
1121231102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28030777564 (or 28030777560 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1121231102120 its reverse (212011321211), we get a palindrome (1333242423331).
The spelling of 1121231102120 in words is "one trillion, one hundred twenty-one billion, two hundred thirty-one million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •