Base | Representation |
---|---|
bin | 10011010111111111101… |
… | …010111010110000000001 |
3 | 11201021122221121010122102 |
4 | 103113333222322300001 |
5 | 133303234142211413 |
6 | 2455352534320145 |
7 | 165123120055532 |
oct | 23277752726001 |
9 | 4637587533572 |
10 | 1331434335233 |
11 | 473726a76542 |
12 | 19605a7b9055 |
13 | 987276a02c2 |
14 | 486282c2689 |
15 | 24978927458 |
hex | 135ffabac01 |
1331434335233 has 2 divisors, whose sum is σ = 1331434335234. Its totient is φ = 1331434335232.
The previous prime is 1331434335191. The next prime is 1331434335247. The reversal of 1331434335233 is 3325334341331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1050610650049 + 280823685184 = 1024993^2 + 529928^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331434335233 - 26 = 1331434335169 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1331434331233) 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, 665717167616 + 665717167617.
It is an arithmetic number, because the mean of its divisors is an integer number (665717167617).
Almost surely, 21331434335233 is an apocalyptic number.
It is an amenable number.
1331434335233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331434335233 is an equidigital number, since it uses as much as digits as its factorization.
1331434335233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 349920, while the sum is 38.
Adding to 1331434335233 its reverse (3325334341331), we get a palindrome (4656768676564).
The spelling of 1331434335233 in words is "one trillion, three hundred thirty-one billion, four hundred thirty-four million, three hundred thirty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •