Base | Representation |
---|---|
bin | 10011010111110001101… |
… | …110010000100100010001 |
3 | 11201021001122021102210222 |
4 | 103113301232100210101 |
5 | 133302244241030001 |
6 | 2455313415002425 |
7 | 165114246051533 |
oct | 23276156204421 |
9 | 4637048242728 |
10 | 1331200330001 |
11 | 473616977993 |
12 | 195bb4369415 |
13 | 986bb06ac79 |
14 | 486051ab853 |
15 | 2496310261b |
hex | 135f1b90911 |
1331200330001 has 2 divisors, whose sum is σ = 1331200330002. Its totient is φ = 1331200330000.
The previous prime is 1331200329931. The next prime is 1331200330003. The reversal of 1331200330001 is 1000330021331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 873140736400 + 458059593601 = 934420^2 + 676801^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331200330001 is a prime.
Together with 1331200330003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1331200330003) 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 as a sum of consecutive naturals, namely, 665600165000 + 665600165001.
It is an arithmetic number, because the mean of its divisors is an integer number (665600165001).
Almost surely, 21331200330001 is an apocalyptic number.
It is an amenable number.
1331200330001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331200330001 is an equidigital number, since it uses as much as digits as its factorization.
1331200330001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1331200330001 its reverse (1000330021331), we get a palindrome (2331530351332).
The spelling of 1331200330001 in words is "one trillion, three hundred thirty-one billion, two hundred million, three hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •