Base | Representation |
---|---|
bin | 10011011000110011010… |
… | …010010110110111011111 |
3 | 11201100220022002022111011 |
4 | 103120303102112313133 |
5 | 133312022334441111 |
6 | 2500014511240051 |
7 | 165153433541323 |
oct | 23306322266737 |
9 | 4640808068434 |
10 | 1332300312031 |
11 | 47403087a747 |
12 | 196260819027 |
13 | 98834c13700 |
14 | 486ab303983 |
15 | 249c9983021 |
hex | 13633496ddf |
1332300312031 has 12 divisors (see below), whose sum is σ = 1444306081680. Its totient is φ = 1228419603840.
The previous prime is 1332300312023. The next prime is 1332300312053. The reversal of 1332300312031 is 1302130032331.
It is not a de Polignac number, because 1332300312031 - 23 = 1332300312023 is a prime.
It is a super-2 number, since 2×13323003120312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332300311993 and 1332300312011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332300312071) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4325251 + ... + 4623028.
It is an arithmetic number, because the mean of its divisors is an integer number (120358840140).
Almost surely, 21332300312031 is an apocalyptic number.
1332300312031 is a deficient number, since it is larger than the sum of its proper divisors (112005769649).
1332300312031 is an equidigital number, since it uses as much as digits as its factorization.
1332300312031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8949186 (or 8949173 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 1332300312031 its reverse (1302130032331), we get a palindrome (2634430344362).
The spelling of 1332300312031 in words is "one trillion, three hundred thirty-two billion, three hundred million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •