Base | Representation |
---|---|
bin | 10011000101010001010… |
… | …111010110101100010001 |
3 | 11122100202211221021022210 |
4 | 103011101113112230101 |
5 | 132441101001231113 |
6 | 2442230003022333 |
7 | 163511660646000 |
oct | 23052127265421 |
9 | 4570684837283 |
10 | 1311330102033 |
11 | 46614a724586 |
12 | 19218996a9a9 |
13 | 9687252c123 |
14 | 4767c226c37 |
15 | 2419d96c6c3 |
hex | 131515d6b11 |
1311330102033 has 32 divisors (see below), whose sum is σ = 2094105337600. Its totient is φ = 729079263360.
The previous prime is 1311330102031. The next prime is 1311330102053. The reversal of 1311330102033 is 3302010331131.
It is not a de Polignac number, because 1311330102033 - 21 = 1311330102031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1311330102031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17183188 + ... + 17259333.
It is an arithmetic number, because the mean of its divisors is an integer number (65440791800).
Almost surely, 21311330102033 is an apocalyptic number.
It is an amenable number.
1311330102033 is a deficient number, since it is larger than the sum of its proper divisors (782775235567).
1311330102033 is an equidigital number, since it uses as much as digits as its factorization.
1311330102033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34442582 (or 34442568 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1311330102033 its reverse (3302010331131), we get a palindrome (4613340433164).
The spelling of 1311330102033 in words is "one trillion, three hundred eleven billion, three hundred thirty million, one hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •