Base | Representation |
---|---|
bin | 111101111111010100… |
… | …1000101110001111001 |
3 | 110201121110000210122211 |
4 | 1323332221011301321 |
5 | 4140113012001241 |
6 | 141053253215121 |
7 | 12421603362331 |
oct | 1737651056171 |
9 | 421543023584 |
10 | 133121203321 |
11 | 515024a3407 |
12 | 219720314a1 |
13 | c7267148c2 |
14 | 662bc220c1 |
15 | 36e1d99781 |
hex | 1efea45c79 |
133121203321 has 2 divisors, whose sum is σ = 133121203322. Its totient is φ = 133121203320.
The previous prime is 133121203249. The next prime is 133121203333. The reversal of 133121203321 is 123302121331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130728526096 + 2392677225 = 361564^2 + 48915^2 .
It is a cyclic number.
It is not a de Polignac number, because 133121203321 - 219 = 133120679033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133121203292 and 133121203301.
It is not a weakly prime, because it can be changed into another prime (133121203381) 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, 66560601660 + 66560601661.
It is an arithmetic number, because the mean of its divisors is an integer number (66560601661).
Almost surely, 2133121203321 is an apocalyptic number.
It is an amenable number.
133121203321 is a deficient number, since it is larger than the sum of its proper divisors (1).
133121203321 is an equidigital number, since it uses as much as digits as its factorization.
133121203321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 133121203321 its reverse (123302121331), we get a palindrome (256423324652).
The spelling of 133121203321 in words is "one hundred thirty-three billion, one hundred twenty-one million, two hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •