Base | Representation |
---|---|
bin | 10000010100111101100… |
… | …111001000100100001100 |
3 | 10222021010111211102200010 |
4 | 100110331213020210030 |
5 | 121340344123230012 |
6 | 2215240545233220 |
7 | 144030463525263 |
oct | 20247547104414 |
9 | 3867114742603 |
10 | 1122020133132 |
11 | 3a2934128a28 |
12 | 161556332810 |
13 | 81a62b59152 |
14 | 3c43dba95da |
15 | 1e2bdc59c3c |
hex | 1053d9c890c |
1122020133132 has 48 divisors (see below), whose sum is σ = 2647630389600. Its totient is φ = 369781040640.
The previous prime is 1122020133121. The next prime is 1122020133211. The reversal of 1122020133132 is 2313310202211.
It is a junction number, because it is equal to n+sod(n) for n = 1122020133099 and 1122020133108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27898494 + ... + 27938682.
It is an arithmetic number, because the mean of its divisors is an integer number (55158966450).
Almost surely, 21122020133132 is an apocalyptic number.
1122020133132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122020133132 is an abundant number, since it is smaller than the sum of its proper divisors (1525610256468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122020133132 is a wasteful number, since it uses less digits than its factorization.
1122020133132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66426 (or 66424 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1122020133132 its reverse (2313310202211), we get a palindrome (3435330335343).
The spelling of 1122020133132 in words is "one trillion, one hundred twenty-two billion, twenty million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •