Base | Representation |
---|---|
bin | 10011011001011101000… |
… | …111100010110000011101 |
3 | 11201102201012122212100002 |
4 | 103121131013202300131 |
5 | 133314442020321341 |
6 | 2500212301344045 |
7 | 165210015033332 |
oct | 23313507426035 |
9 | 4642635585302 |
10 | 1333002120221 |
11 | 474360a44612 |
12 | 196417868025 |
13 | 98917436b25 |
14 | 487365cc989 |
15 | 24a1b3b129b |
hex | 1365d1e2c1d |
1333002120221 has 2 divisors, whose sum is σ = 1333002120222. Its totient is φ = 1333002120220.
The previous prime is 1333002120187. The next prime is 1333002120239. The reversal of 1333002120221 is 1220212003331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1239281032900 + 93721087321 = 1113230^2 + 306139^2 .
It is a cyclic number.
It is not a de Polignac number, because 1333002120221 - 226 = 1332935011357 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 = 1333002120193 and 1333002120202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1333002120721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666501060110 + 666501060111.
It is an arithmetic number, because the mean of its divisors is an integer number (666501060111).
Almost surely, 21333002120221 is an apocalyptic number.
It is an amenable number.
1333002120221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1333002120221 is an equidigital number, since it uses as much as digits as its factorization.
1333002120221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1333002120221 its reverse (1220212003331), we get a palindrome (2553214123552).
The spelling of 1333002120221 in words is "one trillion, three hundred thirty-three billion, two million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •