Base | Representation |
---|---|
bin | 10000010011000110011… |
… | …001010001110001011000 |
3 | 10222001222010020202110010 |
4 | 100103012121101301120 |
5 | 121322300110341440 |
6 | 2214310255521520 |
7 | 143630066010552 |
oct | 20230631216130 |
9 | 3861863222403 |
10 | 1120020012120 |
11 | 3a1aa8109459 |
12 | 1610985292a0 |
13 | 8180466b9a9 |
14 | 3c2d02bc4d2 |
15 | 1e203371580 |
hex | 104c6651c58 |
1120020012120 has 32 divisors (see below), whose sum is σ = 3360060036720. Its totient is φ = 298672003200.
The previous prime is 1120020012109. The next prime is 1120020012149. The reversal of 1120020012120 is 212100200211.
It is a super-3 number, since 3×11200200121203 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1120020012096 and 1120020012105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4666749931 + ... + 4666750170.
Almost surely, 21120020012120 is an apocalyptic number.
1120020012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1120020012120 is an abundant number, since it is smaller than the sum of its proper divisors (2240040024600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120020012120 is a wasteful number, since it uses less digits than its factorization.
1120020012120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9333500115 (or 9333500111 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1120020012120 its reverse (212100200211), we get a palindrome (1332120212331).
The spelling of 1120020012120 in words is "one trillion, one hundred twenty billion, twenty million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •