Base | Representation |
---|---|
bin | 10011010110101011011… |
… | …011011111000000111001 |
3 | 11201011000110011102202001 |
4 | 103112223123133000321 |
5 | 133242340334101241 |
6 | 2455000405541001 |
7 | 165043105665403 |
oct | 23265333370071 |
9 | 4634013142661 |
10 | 1330021003321 |
11 | 47307120133a |
12 | 195925414761 |
13 | 9856093452a |
14 | 485326ddb73 |
15 | 248e47ec431 |
hex | 135ab6df039 |
1330021003321 has 2 divisors, whose sum is σ = 1330021003322. Its totient is φ = 1330021003320.
The previous prime is 1330021003309. The next prime is 1330021003357. The reversal of 1330021003321 is 1233001200331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 865251575721 + 464769427600 = 930189^2 + 681740^2 .
It is an emirp because it is prime and its reverse (1233001200331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1330021003321 - 211 = 1330021001273 is a prime.
It is not a weakly prime, because it can be changed into another prime (1330021004321) 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 as a sum of consecutive naturals, namely, 665010501660 + 665010501661.
It is an arithmetic number, because the mean of its divisors is an integer number (665010501661).
Almost surely, 21330021003321 is an apocalyptic number.
It is an amenable number.
1330021003321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330021003321 is an equidigital number, since it uses as much as digits as its factorization.
1330021003321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1330021003321 its reverse (1233001200331), we get a palindrome (2563022203652).
The spelling of 1330021003321 in words is "one trillion, three hundred thirty billion, twenty-one million, three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •