Base | Representation |
---|---|
bin | 100001000000100101111101… |
… | …000001010010010010010011 |
3 | 201001000201101001120020122221 |
4 | 201000211331001102102103 |
5 | 123012032013441424024 |
6 | 1232433022055041511 |
7 | 42402432505244545 |
oct | 4100457501222223 |
9 | 631021331506587 |
10 | 145176287061139 |
11 | 42291a10342a74 |
12 | 14348178970297 |
13 | 63010b0115159 |
14 | 27bc7d96c1695 |
15 | 11bb57d4963e4 |
hex | 84097d052493 |
145176287061139 has 2 divisors, whose sum is σ = 145176287061140. Its totient is φ = 145176287061138.
The previous prime is 145176287061107. The next prime is 145176287061163. The reversal of 145176287061139 is 931160782671541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145176287061139 - 25 = 145176287061107 is a prime.
It is not a weakly prime, because it can be changed into another prime (145176287068139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72588143530569 + 72588143530570.
It is an arithmetic number, because the mean of its divisors is an integer number (72588143530570).
It is a 1-persistent number, because it is pandigital, but 2⋅145176287061139 = 290352574122278 is not.
Almost surely, 2145176287061139 is an apocalyptic number.
145176287061139 is a deficient number, since it is larger than the sum of its proper divisors (1).
145176287061139 is an equidigital number, since it uses as much as digits as its factorization.
145176287061139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15240960, while the sum is 61.
The spelling of 145176287061139 in words is "one hundred forty-five trillion, one hundred seventy-six billion, two hundred eighty-seven million, sixty-one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •