Base | Representation |
---|---|
bin | 10011010111100110100… |
… | …000101110011101001001 |
3 | 11201020120112100010021121 |
4 | 103113212200232131021 |
5 | 133301403112424113 |
6 | 2455243015235241 |
7 | 165106503211060 |
oct | 23274640563511 |
9 | 4636515303247 |
10 | 1331012233033 |
11 | 47352a78494a |
12 | 195b61378b21 |
13 | 9868b0c07a2 |
14 | 485c82071d7 |
15 | 24951849e8d |
hex | 135e682e749 |
1331012233033 has 4 divisors (see below), whose sum is σ = 1521156837760. Its totient is φ = 1140867628308.
The previous prime is 1331012233021. The next prime is 1331012233039. The reversal of 1331012233033 is 3303322101331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331012233033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1331012232989 and 1331012233007.
It is not an unprimeable number, because it can be changed into a prime (1331012233039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95072302353 + ... + 95072302366.
It is an arithmetic number, because the mean of its divisors is an integer number (380289209440).
Almost surely, 21331012233033 is an apocalyptic number.
It is an amenable number.
1331012233033 is a deficient number, since it is larger than the sum of its proper divisors (190144604727).
1331012233033 is an equidigital number, since it uses as much as digits as its factorization.
1331012233033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190144604726.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 1331012233033 its reverse (3303322101331), we get a palindrome (4634334334364).
The spelling of 1331012233033 in words is "one trillion, three hundred thirty-one billion, twelve million, two hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •