Base | Representation |
---|---|
bin | 11110001111101111011110… |
… | …011101001111100001010101 |
3 | 122102222220001001001120002111 |
4 | 132033233132131033201111 |
5 | 114413422420032111432 |
6 | 1150525555325311021 |
7 | 40006415006426533 |
oct | 3617573635174125 |
9 | 572886031046074 |
10 | 133023164332117 |
11 | 394268973a4534 |
12 | 12b04944705471 |
13 | 592c052220787 |
14 | 24bc4d971d153 |
15 | 105a38775d347 |
hex | 78fbde74f855 |
133023164332117 has 2 divisors, whose sum is σ = 133023164332118. Its totient is φ = 133023164332116.
The previous prime is 133023164332103. The next prime is 133023164332141. The reversal of 133023164332117 is 711233461320331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131896358728996 + 1126805603121 = 11484614^2 + 1061511^2 .
It is a cyclic number.
It is not a de Polignac number, because 133023164332117 - 219 = 133023163807829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133023164332117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133023164333117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66511582166058 + 66511582166059.
It is an arithmetic number, because the mean of its divisors is an integer number (66511582166059).
Almost surely, 2133023164332117 is an apocalyptic number.
It is an amenable number.
133023164332117 is a deficient number, since it is larger than the sum of its proper divisors (1).
133023164332117 is an equidigital number, since it uses as much as digits as its factorization.
133023164332117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 163296, while the sum is 40.
The spelling of 133023164332117 in words is "one hundred thirty-three trillion, twenty-three billion, one hundred sixty-four million, three hundred thirty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •