Base | Representation |
---|---|
bin | 10000010011001101001… |
… | …000011000000110110100 |
3 | 10222002020222220021001010 |
4 | 100103031020120012310 |
5 | 121323013023202012 |
6 | 2214325414032220 |
7 | 143632640410035 |
oct | 20231510300664 |
9 | 3862228807033 |
10 | 1120133022132 |
11 | 3a2055986563 |
12 | 16110a348670 |
13 | 81821bb9117 |
14 | 3c3012d8a8c |
15 | 1e20d245c3c |
hex | 104cd2181b4 |
1120133022132 has 24 divisors (see below), whose sum is σ = 2613817424736. Its totient is φ = 373352858848.
The previous prime is 1120133022103. The next prime is 1120133022139. The reversal of 1120133022132 is 2312203310211.
It is a junction number, because it is equal to n+sod(n) for n = 1120133022099 and 1120133022108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120133022139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2913363 + ... + 3275354.
It is an arithmetic number, because the mean of its divisors is an integer number (108909059364).
Almost surely, 21120133022132 is an apocalyptic number.
1120133022132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1120133022132 is an abundant number, since it is smaller than the sum of its proper divisors (1493684402604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120133022132 is a wasteful number, since it uses less digits than its factorization.
1120133022132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6203807 (or 6203805 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1120133022132 its reverse (2312203310211), we get a palindrome (3432336332343).
The spelling of 1120133022132 in words is "one trillion, one hundred twenty billion, one hundred thirty-three million, twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •