Base | Representation |
---|---|
bin | 10000010101000011101… |
… | …100011111101110011100 |
3 | 10222021101121220001212000 |
4 | 100111003230133232130 |
5 | 121341101240431022 |
6 | 2215255033042300 |
7 | 144033143225220 |
oct | 20250354375634 |
9 | 3867347801760 |
10 | 1122122202012 |
11 | 3a2986802879 |
12 | 161584556390 |
13 | 81a7b045536 |
14 | 3c44d578780 |
15 | 1e2c7bbc6ac |
hex | 10543b1fb9c |
1122122202012 has 96 divisors (see below), whose sum is σ = 3357725629440. Its totient is φ = 317432001600.
The previous prime is 1122122201999. The next prime is 1122122202017. The reversal of 1122122202012 is 2102022212211.
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 (1122122202017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7271608 + ... + 7424319.
It is an arithmetic number, because the mean of its divisors is an integer number (34976308640).
Almost surely, 21122122202012 is an apocalyptic number.
1122122202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122122202012 is an abundant number, since it is smaller than the sum of its proper divisors (2235603427428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122122202012 is a wasteful number, since it uses less digits than its factorization.
1122122202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14696048 (or 14696040 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1122122202012 its reverse (2102022212211), we get a palindrome (3224144414223).
The spelling of 1122122202012 in words is "one trillion, one hundred twenty-two billion, one hundred twenty-two million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •