Base | Representation |
---|---|
bin | 10011010110101010011… |
… | …000000100011111001101 |
3 | 11201010222012220120220102 |
4 | 103112222120010133031 |
5 | 133242321323043041 |
6 | 2454554535100445 |
7 | 165042502532561 |
oct | 23265230043715 |
9 | 4633865816812 |
10 | 1330003331021 |
11 | 473062230932 |
12 | 19591b511725 |
13 | 9855a087751 |
14 | 4853021d6a1 |
15 | 248e2eab09b |
hex | 135aa6047cd |
1330003331021 has 2 divisors, whose sum is σ = 1330003331022. Its totient is φ = 1330003331020.
The previous prime is 1330003330993. The next prime is 1330003331051. The reversal of 1330003331021 is 1201333000331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1126593310921 + 203410020100 = 1061411^2 + 451010^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330003331021 - 214 = 1330003314637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1330003330984 and 1330003331002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330003331051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665001665510 + 665001665511.
It is an arithmetic number, because the mean of its divisors is an integer number (665001665511).
Almost surely, 21330003331021 is an apocalyptic number.
It is an amenable number.
1330003331021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330003331021 is an equidigital number, since it uses as much as digits as its factorization.
1330003331021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1330003331021 its reverse (1201333000331), we get a palindrome (2531336331352).
The spelling of 1330003331021 in words is "one trillion, three hundred thirty billion, three million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •