Base | Representation |
---|---|
bin | 111101111111101011… |
… | …1101010110000111001 |
3 | 110201122022000010210012 |
4 | 1323333113222300321 |
5 | 4140124123212213 |
6 | 141054411031305 |
7 | 12422112225326 |
oct | 1737727526071 |
9 | 421568003705 |
10 | 133133413433 |
11 | 51509383009 |
12 | 2197613b535 |
13 | c7290cb417 |
14 | 662d6bdb4d |
15 | 36e2eac4a8 |
hex | 1eff5eac39 |
133133413433 has 2 divisors, whose sum is σ = 133133413434. Its totient is φ = 133133413432.
The previous prime is 133133413423. The next prime is 133133413453. The reversal of 133133413433 is 334314331331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67889950249 + 65243463184 = 260557^2 + 255428^2 .
It is an emirp because it is prime and its reverse (334314331331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133133413433 - 234 = 115953544249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133133413433.
It is not a weakly prime, because it can be changed into another prime (133133413423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66566706716 + 66566706717.
It is an arithmetic number, because the mean of its divisors is an integer number (66566706717).
Almost surely, 2133133413433 is an apocalyptic number.
It is an amenable number.
133133413433 is a deficient number, since it is larger than the sum of its proper divisors (1).
133133413433 is an equidigital number, since it uses as much as digits as its factorization.
133133413433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34992, while the sum is 32.
Adding to 133133413433 its reverse (334314331331), we get a palindrome (467447744764).
The spelling of 133133413433 in words is "one hundred thirty-three billion, one hundred thirty-three million, four hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •