Base | Representation |
---|---|
bin | 111110001111100010… |
… | …1101010111010111001 |
3 | 110210000101100022102002 |
4 | 1330133011222322321 |
5 | 4142221341111033 |
6 | 141223300550345 |
7 | 12441233365562 |
oct | 1743705527271 |
9 | 423011308362 |
10 | 133665566393 |
11 | 51761800447 |
12 | 21aa43b23b5 |
13 | c7b2430428 |
14 | 6680245169 |
15 | 3724a773e8 |
hex | 1f1f16aeb9 |
133665566393 has 2 divisors, whose sum is σ = 133665566394. Its totient is φ = 133665566392.
The previous prime is 133665566327. The next prime is 133665566399. The reversal of 133665566393 is 393665566331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88239890704 + 45425675689 = 297052^2 + 213133^2 .
It is an emirp because it is prime and its reverse (393665566331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133665566393 is a prime.
It is a super-2 number, since 2×1336655663932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133665566399) 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, 66832783196 + 66832783197.
It is an arithmetic number, because the mean of its divisors is an integer number (66832783197).
Almost surely, 2133665566393 is an apocalyptic number.
It is an amenable number.
133665566393 is a deficient number, since it is larger than the sum of its proper divisors (1).
133665566393 is an equidigital number, since it uses as much as digits as its factorization.
133665566393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23619600, while the sum is 56.
The spelling of 133665566393 in words is "one hundred thirty-three billion, six hundred sixty-five million, five hundred sixty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •