Base | Representation |
---|---|
bin | 11101101100100000110… |
… | …11010010010001101001 |
3 | 10121112122120111201221221 |
4 | 32312100123102101221 |
5 | 113204114030233001 |
6 | 2100422215502041 |
7 | 133500510425635 |
oct | 16662033222151 |
9 | 3545576451857 |
10 | 1020330321001 |
11 | 3637a0958a82 |
12 | 1458b6687921 |
13 | 752a8229394 |
14 | 37554555dc5 |
15 | 1b81b4d01a1 |
hex | ed906d2469 |
1020330321001 has 2 divisors, whose sum is σ = 1020330321002. Its totient is φ = 1020330321000.
The previous prime is 1020330320969. The next prime is 1020330321029. The reversal of 1020330321001 is 1001230330201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 987678192400 + 32652128601 = 993820^2 + 180699^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020330321001 - 25 = 1020330320969 is a prime.
It is a super-3 number, since 3×10203303210013 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1020330321071) 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, 510165160500 + 510165160501.
It is an arithmetic number, because the mean of its divisors is an integer number (510165160501).
Almost surely, 21020330321001 is an apocalyptic number.
It is an amenable number.
1020330321001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020330321001 is an equidigital number, since it uses as much as digits as its factorization.
1020330321001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1020330321001 its reverse (1001230330201), we get a palindrome (2021560651202).
The spelling of 1020330321001 in words is "one trillion, twenty billion, three hundred thirty million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •