Base | Representation |
---|---|
bin | 111110000010101100… |
… | …0101010011101101001 |
3 | 110201220022220121202211 |
4 | 1330011120222131221 |
5 | 4140330442301031 |
6 | 141112414125121 |
7 | 12424446120106 |
oct | 1740530523551 |
9 | 421808817684 |
10 | 133234337641 |
11 | 51560345949 |
12 | 219a3ab07a1 |
13 | c743ca67a2 |
14 | 663cc71aad |
15 | 36ebc95bb1 |
hex | 1f0562a769 |
133234337641 has 2 divisors, whose sum is σ = 133234337642. Its totient is φ = 133234337640.
The previous prime is 133234337623. The next prime is 133234337651. The reversal of 133234337641 is 146733432331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77807523600 + 55426814041 = 278940^2 + 235429^2 .
It is a cyclic number.
It is not a de Polignac number, because 133234337641 - 27 = 133234337513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133234337594 and 133234337603.
It is not a weakly prime, because it can be changed into another prime (133234337651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66617168820 + 66617168821.
It is an arithmetic number, because the mean of its divisors is an integer number (66617168821).
Almost surely, 2133234337641 is an apocalyptic number.
It is an amenable number.
133234337641 is a deficient number, since it is larger than the sum of its proper divisors (1).
133234337641 is an equidigital number, since it uses as much as digits as its factorization.
133234337641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 326592, while the sum is 40.
Adding to 133234337641 its reverse (146733432331), we get a palindrome (279967769972).
The spelling of 133234337641 in words is "one hundred thirty-three billion, two hundred thirty-four million, three hundred thirty-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •