Base | Representation |
---|---|
bin | 10000011111010011001… |
… | …110001110100100101100 |
3 | 11000022210002102020122210 |
4 | 100133103032032210230 |
5 | 122031112222334012 |
6 | 2224314224410420 |
7 | 144602526053316 |
oct | 20372316164454 |
9 | 4008702366583 |
10 | 1133120121132 |
11 | 3a760a84a22a |
12 | 163733776a10 |
13 | 82b116c199c |
14 | 3cbb40667b6 |
15 | 1e71d49a23c |
hex | 107d338e92c |
1133120121132 has 96 divisors (see below), whose sum is σ = 2795237294080. Its totient is φ = 356698520640.
The previous prime is 1133120121053. The next prime is 1133120121137. The reversal of 1133120121132 is 2311210213311.
It is a super-2 number, since 2×11331201211322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1133120121099 and 1133120121108.
It is not an unprimeable number, because it can be changed into a prime (1133120121137) 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, 17931969 + ... + 17995047.
Almost surely, 21133120121132 is an apocalyptic number.
1133120121132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1133120121132 is an abundant number, since it is smaller than the sum of its proper divisors (1662117172948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133120121132 is a wasteful number, since it uses less digits than its factorization.
1133120121132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64283 (or 64281 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1133120121132 its reverse (2311210213311), we get a palindrome (3444330334443).
The spelling of 1133120121132 in words is "one trillion, one hundred thirty-three billion, one hundred twenty million, one hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •