Base | Representation |
---|---|
bin | 100001000101101010110011… |
… | …111010001111011000011001 |
3 | 201002021001201110020100101101 |
4 | 201011222303322033120121 |
5 | 123033240401134441324 |
6 | 1233301150321351401 |
7 | 42436561435044211 |
oct | 4105526372173031 |
9 | 632231643210341 |
10 | 145525100312089 |
11 | 42406937327183 |
12 | 143a38a5798561 |
13 | 6327c5bb7b7b4 |
14 | 27d16496b3241 |
15 | 11c569622a944 |
hex | 845ab3e8f619 |
145525100312089 has 2 divisors, whose sum is σ = 145525100312090. Its totient is φ = 145525100312088.
The previous prime is 145525100312023. The next prime is 145525100312149. The reversal of 145525100312089 is 980213001525541.
145525100312089 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100693036606464 + 44832063705625 = 10034592^2 + 6695675^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145525100312089 is a prime.
It is not a weakly prime, because it can be changed into another prime (145525100312789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72762550156044 + 72762550156045.
It is an arithmetic number, because the mean of its divisors is an integer number (72762550156045).
Almost surely, 2145525100312089 is an apocalyptic number.
It is an amenable number.
145525100312089 is a deficient number, since it is larger than the sum of its proper divisors (1).
145525100312089 is an equidigital number, since it uses as much as digits as its factorization.
145525100312089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432000, while the sum is 46.
The spelling of 145525100312089 in words is "one hundred forty-five trillion, five hundred twenty-five billion, one hundred million, three hundred twelve thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •