Base | Representation |
---|---|
bin | 11110010100000110110100… |
… | …110011001001111101001101 |
3 | 122111001120020222122222010122 |
4 | 132110012310303021331031 |
5 | 114433331213431103031 |
6 | 1151315443113314325 |
7 | 40040164013316134 |
oct | 3624066463117515 |
9 | 574046228588118 |
10 | 133323113144141 |
11 | 39532018709518 |
12 | 12b52ab4a059a5 |
13 | 595141456932b |
14 | 24ccc31b3891b |
15 | 10630906aa47b |
hex | 7941b4cc9f4d |
133323113144141 has 2 divisors, whose sum is σ = 133323113144142. Its totient is φ = 133323113144140.
The previous prime is 133323113144059. The next prime is 133323113144149. The reversal of 133323113144141 is 141441311323331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126803026669225 + 6520086474916 = 11260685^2 + 2553446^2 .
It is a cyclic number.
It is not a de Polignac number, because 133323113144141 - 218 = 133323112881997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133323113144149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66661556572070 + 66661556572071.
It is an arithmetic number, because the mean of its divisors is an integer number (66661556572071).
Almost surely, 2133323113144141 is an apocalyptic number.
It is an amenable number.
133323113144141 is a deficient number, since it is larger than the sum of its proper divisors (1).
133323113144141 is an equidigital number, since it uses as much as digits as its factorization.
133323113144141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 35.
Adding to 133323113144141 its reverse (141441311323331), we get a palindrome (274764424467472).
The spelling of 133323113144141 in words is "one hundred thirty-three trillion, three hundred twenty-three billion, one hundred thirteen million, one hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •