Base | Representation |
---|---|
bin | 10011011000101101011… |
… | …000101100011110011111 |
3 | 11201100122101210111101101 |
4 | 103120231120230132133 |
5 | 133311322013410421 |
6 | 2500001013253531 |
7 | 165151122204100 |
oct | 23305530543637 |
9 | 4640571714341 |
10 | 1332201310111 |
11 | 473a8aa00081 |
12 | 1962336342a7 |
13 | 9881a55c2a9 |
14 | 4869c0d23a7 |
15 | 249c0e29191 |
hex | 1362d62c79f |
1332201310111 has 12 divisors (see below), whose sum is σ = 1550750039280. Its totient is φ = 1141115750880.
The previous prime is 1332201310051. The next prime is 1332201310127. The reversal of 1332201310111 is 1110131022331.
It is not a de Polignac number, because 1332201310111 - 27 = 1332201309983 is a prime.
It is a super-2 number, since 2×13322013101112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332201310171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9106291 + ... + 9251428.
It is an arithmetic number, because the mean of its divisors is an integer number (129229169940).
Almost surely, 21332201310111 is an apocalyptic number.
1332201310111 is a deficient number, since it is larger than the sum of its proper divisors (218548729169).
1332201310111 is a wasteful number, since it uses less digits than its factorization.
1332201310111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18359214 (or 18359207 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1332201310111 its reverse (1110131022331), we get a palindrome (2442332332442).
The spelling of 1332201310111 in words is "one trillion, three hundred thirty-two billion, two hundred one million, three hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •