Base | Representation |
---|---|
bin | 111101111011110011… |
… | …1000100010110011101 |
3 | 110201022020001021100102 |
4 | 1323313213010112131 |
5 | 4134342311421134 |
6 | 141033440510445 |
7 | 12415641552506 |
oct | 1736747042635 |
9 | 421266037312 |
10 | 133003232669 |
11 | 514519482aa |
12 | 2193a61b425 |
13 | c70814b598 |
14 | 661a2b3bad |
15 | 36d684537e |
hex | 1ef79c459d |
133003232669 has 2 divisors, whose sum is σ = 133003232670. Its totient is φ = 133003232668.
The previous prime is 133003232653. The next prime is 133003232683. The reversal of 133003232669 is 966232300331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103680780025 + 29322452644 = 321995^2 + 171238^2 .
It is an emirp because it is prime and its reverse (966232300331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133003232669 - 24 = 133003232653 is a prime.
It is a super-2 number, since 2×1330032326692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133003232689) 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, 66501616334 + 66501616335.
It is an arithmetic number, because the mean of its divisors is an integer number (66501616335).
Almost surely, 2133003232669 is an apocalyptic number.
It is an amenable number.
133003232669 is a deficient number, since it is larger than the sum of its proper divisors (1).
133003232669 is an equidigital number, since it uses as much as digits as its factorization.
133003232669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 38.
The spelling of 133003232669 in words is "one hundred thirty-three billion, three million, two hundred thirty-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •