Base | Representation |
---|---|
bin | 10011011000110011010… |
… | …101011100101001010101 |
3 | 11201100220100121110201221 |
4 | 103120303111130221111 |
5 | 133312023041402013 |
6 | 2500014540450341 |
7 | 165153443454202 |
oct | 23306325345125 |
9 | 4640810543657 |
10 | 1332301122133 |
11 | 474031283353 |
12 | 196260b499b1 |
13 | 98835138367 |
14 | 486ab474ca9 |
15 | 249c9a9308d |
hex | 1363355ca55 |
1332301122133 has 8 divisors (see below), whose sum is σ = 1345764231360. Its totient is φ = 1318892191200.
The previous prime is 1332301122083. The next prime is 1332301122137. The reversal of 1332301122133 is 3312211032331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332301122133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332301122098 and 1332301122107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332301122137) 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, 13495143 + ... + 13593508.
It is an arithmetic number, because the mean of its divisors is an integer number (168220528920).
Almost surely, 21332301122133 is an apocalyptic number.
It is an amenable number.
1332301122133 is a deficient number, since it is larger than the sum of its proper divisors (13463109227).
1332301122133 is a wasteful number, since it uses less digits than its factorization.
1332301122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27089147.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1332301122133 its reverse (3312211032331), we get a palindrome (4644512154464).
The spelling of 1332301122133 in words is "one trillion, three hundred thirty-two billion, three hundred one million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •