Base | Representation |
---|---|
bin | 10000010101000011100… |
… | …100111100010100111100 |
3 | 10222021101111011110210200 |
4 | 100111003210330110330 |
5 | 121341100234101022 |
6 | 2215254522403500 |
7 | 144033120340506 |
oct | 20250344742474 |
9 | 3867344143720 |
10 | 1122120222012 |
11 | 3a2985680209 |
12 | 161583960590 |
13 | 81a7a80123a |
14 | 3c44d1c0d76 |
15 | 1e2c792abac |
hex | 1054393c53c |
1122120222012 has 36 divisors (see below), whose sum is σ = 2836517914776. Its totient is φ = 374033829600.
The previous prime is 1122120221939. The next prime is 1122120222029. The reversal of 1122120222012 is 2102220212211.
It is a happy number.
1122120222012 is a `hidden beast` number, since 11 + 221 + 202 + 220 + 12 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2260762 + ... + 2712062.
Almost surely, 21122120222012 is an apocalyptic number.
1122120222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122120222012 is an abundant number, since it is smaller than the sum of its proper divisors (1714397692764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122120222012 is a wasteful number, since it uses less digits than its factorization.
1122120222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 520378 (or 520373 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1122120222012 its reverse (2102220212211), we get a palindrome (3224340434223).
The spelling of 1122120222012 in words is "one trillion, one hundred twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •