Base | Representation |
---|---|
bin | 100011011001000110100010… |
… | …001101111011000100010101 |
3 | 202102010121222021021202212222 |
4 | 203121012202031323010111 |
5 | 130400234240110130031 |
6 | 1311015400320552125 |
7 | 44533551300564221 |
oct | 4331064215730425 |
9 | 672117867252788 |
10 | 155656631333141 |
11 | 45662674478084 |
12 | 1555b36aa82645 |
13 | 68b1485142753 |
14 | 2a61b6d367781 |
15 | 12edebd607e7b |
hex | 8d91a237b115 |
155656631333141 has 2 divisors, whose sum is σ = 155656631333142. Its totient is φ = 155656631333140.
The previous prime is 155656631333033. The next prime is 155656631333183. The reversal of 155656631333141 is 141333136656551.
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., 152091690842116 + 3564940491025 = 12332546^2 + 1888105^2 .
It is a cyclic number.
It is not a de Polignac number, because 155656631333141 - 214 = 155656631316757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155656631333641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77828315666570 + 77828315666571.
It is an arithmetic number, because the mean of its divisors is an integer number (77828315666571).
Almost surely, 2155656631333141 is an apocalyptic number.
It is an amenable number.
155656631333141 is a deficient number, since it is larger than the sum of its proper divisors (1).
155656631333141 is an equidigital number, since it uses as much as digits as its factorization.
155656631333141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8748000, while the sum is 53.
Adding to 155656631333141 its reverse (141333136656551), we get a palindrome (296989767989692).
The spelling of 155656631333141 in words is "one hundred fifty-five trillion, six hundred fifty-six billion, six hundred thirty-one million, three hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •