Base | Representation |
---|---|
bin | 10000010101001000011… |
… | …101010111011100011100 |
3 | 10222021121012021102111000 |
4 | 100111020131113130130 |
5 | 121341232220401022 |
6 | 2215311010030300 |
7 | 144035133436146 |
oct | 20251035273434 |
9 | 3867535242430 |
10 | 1122202122012 |
11 | 3a2a17929964 |
12 | 1615a7278390 |
13 | 81a9177838a |
14 | 3c45a01dc96 |
15 | 1e2cec076ac |
hex | 1054875771c |
1122202122012 has 48 divisors (see below), whose sum is σ = 3003264947200. Its totient is φ = 362000683440.
The previous prime is 1122202122011. The next prime is 1122202122037. The reversal of 1122202122012 is 2102212022211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122202122011) 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 15 ways as a sum of consecutive naturals, for example, 167589562 + ... + 167596257.
Almost surely, 21122202122012 is an apocalyptic number.
1122202122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122202122012 is an abundant number, since it is smaller than the sum of its proper divisors (1881062825188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122202122012 is a wasteful number, since it uses less digits than its factorization.
1122202122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335185863 (or 335185855 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1122202122012 its reverse (2102212022211), we get a palindrome (3224414144223).
The spelling of 1122202122012 in words is "one trillion, one hundred twenty-two billion, two hundred two million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •