Base | Representation |
---|---|
bin | 10011011001011110010… |
… | …000110100101111011101 |
3 | 11201102202112210211202002 |
4 | 103121132100310233131 |
5 | 133320011430033042 |
6 | 2500214225212045 |
7 | 165210340232561 |
oct | 23313620645735 |
9 | 4642675724662 |
10 | 1333021330397 |
11 | 474370875499 |
12 | 196422191025 |
13 | 9891b4018b3 |
14 | 48738d8d6a1 |
15 | 24a1ce08132 |
hex | 1365e434bdd |
1333021330397 has 2 divisors, whose sum is σ = 1333021330398. Its totient is φ = 1333021330396.
The previous prime is 1333021330313. The next prime is 1333021330409. The reversal of 1333021330397 is 7930331203331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1289419296676 + 43602033721 = 1135526^2 + 208811^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1333021330397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1333021330397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1333021330097) 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, 666510665198 + 666510665199.
It is an arithmetic number, because the mean of its divisors is an integer number (666510665199).
Almost surely, 21333021330397 is an apocalyptic number.
It is an amenable number.
1333021330397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1333021330397 is an equidigital number, since it uses as much as digits as its factorization.
1333021330397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 91854, while the sum is 38.
The spelling of 1333021330397 in words is "one trillion, three hundred thirty-three billion, twenty-one million, three hundred thirty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •