Base | Representation |
---|---|
bin | 111101111100011010… |
… | …0100101001101010101 |
3 | 110201100122021121200212 |
4 | 1323320310211031111 |
5 | 4134413012133331 |
6 | 141035444215205 |
7 | 12416306352521 |
oct | 1737064451525 |
9 | 421318247625 |
10 | 133023552341 |
11 | 51462366819 |
12 | 2194539a505 |
13 | c70c414364 |
14 | 661cc82d81 |
15 | 36d850ad2b |
hex | 1ef8d25355 |
133023552341 has 2 divisors, whose sum is σ = 133023552342. Its totient is φ = 133023552340.
The previous prime is 133023552317. The next prime is 133023552383. The reversal of 133023552341 is 143255320331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109790171716 + 23233380625 = 331346^2 + 152425^2 .
It is an emirp because it is prime and its reverse (143255320331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133023552341 - 234 = 115843683157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133023552298 and 133023552307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133023552301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66511776170 + 66511776171.
It is an arithmetic number, because the mean of its divisors is an integer number (66511776171).
Almost surely, 2133023552341 is an apocalyptic number.
It is an amenable number.
133023552341 is a deficient number, since it is larger than the sum of its proper divisors (1).
133023552341 is an equidigital number, since it uses as much as digits as its factorization.
133023552341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 133023552341 its reverse (143255320331), we get a palindrome (276278872672).
The spelling of 133023552341 in words is "one hundred thirty-three billion, twenty-three million, five hundred fifty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •