Base | Representation |
---|---|
bin | 10011011000101000000… |
… | …101100010101001010111 |
3 | 11201100102012111112210120 |
4 | 103120220011202221113 |
5 | 133311131233344111 |
6 | 2455544115523023 |
7 | 165145662412554 |
oct | 23305005425127 |
9 | 4640365445716 |
10 | 1332112403031 |
11 | 473a447a5953 |
12 | 1962098b9473 |
13 | 98805000957 |
14 | 4869038ba2b |
15 | 249b8216406 |
hex | 13628162a57 |
1332112403031 has 8 divisors (see below), whose sum is σ = 1781181458160. Its totient is φ = 885559141632.
The previous prime is 1332112402993. The next prime is 1332112403101. The reversal of 1332112403031 is 1303042112331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1332112403031 - 26 = 1332112402967 is a prime.
It is a super-2 number, since 2×13321124030312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1332112402992 and 1332112403010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332112403231) 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, 628947196 + ... + 628949313.
It is an arithmetic number, because the mean of its divisors is an integer number (222647682270).
Almost surely, 21332112403031 is an apocalyptic number.
1332112403031 is a deficient number, since it is larger than the sum of its proper divisors (449069055129).
1332112403031 is a wasteful number, since it uses less digits than its factorization.
1332112403031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1257896865.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1332112403031 its reverse (1303042112331), we get a palindrome (2635154515362).
The spelling of 1332112403031 in words is "one trillion, three hundred thirty-two billion, one hundred twelve million, four hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •