Base | Representation |
---|---|
bin | 10000011111010011111… |
… | …111110110110100001110 |
3 | 11000022210222220012212120 |
4 | 100133103333312310032 |
5 | 122031124040143042 |
6 | 2224315411313410 |
7 | 144603044460114 |
oct | 20372377666416 |
9 | 4008728805776 |
10 | 1133133131022 |
11 | 3a7617125802 |
12 | 163737bab866 |
13 | 82b142c8549 |
14 | 3cbb5a91ab4 |
15 | 1e71e6b9dec |
hex | 107d3ff6d0e |
1133133131022 has 8 divisors (see below), whose sum is σ = 2266266262056. Its totient is φ = 377711043672.
The previous prime is 1133133131021. The next prime is 1133133131029. The reversal of 1133133131022 is 2201313313311.
It is a sphenic number, since it is the product of 3 distinct primes.
1133133131022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1133133130983 and 1133133131001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133133131021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94427760913 + ... + 94427760924.
It is an arithmetic number, because the mean of its divisors is an integer number (283283282757).
Almost surely, 21133133131022 is an apocalyptic number.
1133133131022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133133131022 is a wasteful number, since it uses less digits than its factorization.
1133133131022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188855521842.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 1133133131022 its reverse (2201313313311), we get a palindrome (3334446444333).
The spelling of 1133133131022 in words is "one trillion, one hundred thirty-three billion, one hundred thirty-three million, one hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •