Base | Representation |
---|---|
bin | 100001000101101010111101… |
… | …100000001001110110110101 |
3 | 201002021002010200001122001001 |
4 | 201011222331200021312311 |
5 | 123033241213334332002 |
6 | 1233301214311003301 |
7 | 42436565431003012 |
oct | 4105527540116665 |
9 | 632232120048031 |
10 | 145525261245877 |
11 | 42406a0a157107 |
12 | 143a392b669531 |
13 | 6327c863082a6 |
14 | 27d1662c06709 |
15 | 11c56a5419a87 |
hex | 845abd809db5 |
145525261245877 has 2 divisors, whose sum is σ = 145525261245878. Its totient is φ = 145525261245876.
The previous prime is 145525261245817. The next prime is 145525261245911. The reversal of 145525261245877 is 778542162525541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 143503364945521 + 2021896300356 = 11979289^2 + 1421934^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145525261245877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145525261245817) 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, 72762630622938 + 72762630622939.
It is an arithmetic number, because the mean of its divisors is an integer number (72762630622939).
Almost surely, 2145525261245877 is an apocalyptic number.
It is an amenable number.
145525261245877 is a deficient number, since it is larger than the sum of its proper divisors (1).
145525261245877 is an equidigital number, since it uses as much as digits as its factorization.
145525261245877 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 188160000, while the sum is 64.
The spelling of 145525261245877 in words is "one hundred forty-five trillion, five hundred twenty-five billion, two hundred sixty-one million, two hundred forty-five thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •