Base | Representation |
---|---|
bin | 11110010001101111111101… |
… | …011001101010110010000101 |
3 | 122110111002010120120200200121 |
4 | 132101233331121222302011 |
5 | 114423202434321123443 |
6 | 1151113213010341541 |
7 | 40022400515135524 |
oct | 3621577531526205 |
9 | 573432116520617 |
10 | 133161122442373 |
11 | 3947a35112a693 |
12 | 12b2762658a8b1 |
13 | 593c069a5c68c |
14 | 24c5065aaa4bb |
15 | 105dc5e0954ed |
hex | 791bfd66ac85 |
133161122442373 has 2 divisors, whose sum is σ = 133161122442374. Its totient is φ = 133161122442372.
The previous prime is 133161122442319. The next prime is 133161122442407. The reversal of 133161122442373 is 373244221161331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103363476569089 + 29797645873284 = 10166783^2 + 5458722^2 .
It is a cyclic number.
It is not a de Polignac number, because 133161122442373 - 221 = 133161120345221 is a prime.
It is a super-2 number, since 2×1331611224423732 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133161122482373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66580561221186 + 66580561221187.
It is an arithmetic number, because the mean of its divisors is an integer number (66580561221187).
Almost surely, 2133161122442373 is an apocalyptic number.
It is an amenable number.
133161122442373 is a deficient number, since it is larger than the sum of its proper divisors (1).
133161122442373 is an equidigital number, since it uses as much as digits as its factorization.
133161122442373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 435456, while the sum is 43.
The spelling of 133161122442373 in words is "one hundred thirty-three trillion, one hundred sixty-one billion, one hundred twenty-two million, four hundred forty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •