Base | Representation |
---|---|
bin | 10011011000110011110… |
… | …111101100100011110101 |
3 | 11201100220222111121100102 |
4 | 103120303313230203311 |
5 | 133312032341201323 |
6 | 2500015501123445 |
7 | 165153612666311 |
oct | 23306367544365 |
9 | 4640828447312 |
10 | 1332310100213 |
11 | 474036355754 |
12 | 196263b59585 |
13 | 98836c5ca31 |
14 | 486ac730b41 |
15 | 249ca768328 |
hex | 13633dec8f5 |
1332310100213 has 8 divisors (see below), whose sum is σ = 1339270186968. Its totient is φ = 1325350600704.
The previous prime is 1332310100203. The next prime is 1332310100249. The reversal of 1332310100213 is 3120010132331.
It can be written as a sum of positive squares in 4 ways, for example, as 1383319249 + 1330926780964 = 37193^2 + 1153658^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1332310100213 - 220 = 1332309051637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332310100203) 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, 4844231 + ... + 5111867.
It is an arithmetic number, because the mean of its divisors is an integer number (167408773371).
Almost surely, 21332310100213 is an apocalyptic number.
It is an amenable number.
1332310100213 is a deficient number, since it is larger than the sum of its proper divisors (6960086755).
1332310100213 is a wasteful number, since it uses less digits than its factorization.
1332310100213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293623.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1332310100213 its reverse (3120010132331), we get a palindrome (4452320232544).
The spelling of 1332310100213 in words is "one trillion, three hundred thirty-two billion, three hundred ten million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •