Base | Representation |
---|---|
bin | 10011010111101101101… |
… | …110001110001011000101 |
3 | 11201020212221222110022101 |
4 | 103113231232032023011 |
5 | 133302130100230313 |
6 | 2455303020232101 |
7 | 165112502415352 |
oct | 23275556161305 |
9 | 4636787873271 |
10 | 1331133211333 |
11 | 473591aa4712 |
12 | 195b9599b631 |
13 | 986aa19aa93 |
14 | 485da2d9629 |
15 | 2495c2955dd |
hex | 135edb8e2c5 |
1331133211333 has 8 divisors (see below), whose sum is σ = 1344171898368. Its totient is φ = 1318096737264.
The previous prime is 1331133211283. The next prime is 1331133211379. The reversal of 1331133211333 is 3331123311331.
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 1331133211333 - 217 = 1331133080261 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 (1331133211633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 668835 + ... + 1763407.
It is an arithmetic number, because the mean of its divisors is an integer number (168021487296).
Almost surely, 21331133211333 is an apocalyptic number.
It is an amenable number.
1331133211333 is a deficient number, since it is larger than the sum of its proper divisors (13038687035).
1331133211333 is a wasteful number, since it uses less digits than its factorization.
1331133211333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106483.
The product of its digits is 4374, while the sum is 28.
Adding to 1331133211333 its reverse (3331123311331), we get a palindrome (4662256522664).
The spelling of 1331133211333 in words is "one trillion, three hundred thirty-one billion, one hundred thirty-three million, two hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •