Base | Representation |
---|---|
bin | 1000011111001101011… |
… | …1111110111010011101 |
3 | 111221101020112201100221 |
4 | 2013303113332322131 |
5 | 4342113132240021 |
6 | 150553141521341 |
7 | 13351324440511 |
oct | 2076327767235 |
9 | 457336481327 |
10 | 145817071261 |
11 | 56927a31954 |
12 | 24315a13251 |
13 | 1099aa9cab4 |
14 | 70b4020141 |
15 | 3bd6773241 |
hex | 21f35fee9d |
145817071261 has 2 divisors, whose sum is σ = 145817071262. Its totient is φ = 145817071260.
The previous prime is 145817071247. The next prime is 145817071273. The reversal of 145817071261 is 162170718541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117892656025 + 27924415236 = 343355^2 + 167106^2 .
It is a cyclic number.
It is not a de Polignac number, because 145817071261 - 25 = 145817071229 is a prime.
It is a super-2 number, since 2×1458170712612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145817071061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72908535630 + 72908535631.
It is an arithmetic number, because the mean of its divisors is an integer number (72908535631).
Almost surely, 2145817071261 is an apocalyptic number.
It is an amenable number.
145817071261 is a deficient number, since it is larger than the sum of its proper divisors (1).
145817071261 is an equidigital number, since it uses as much as digits as its factorization.
145817071261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 94080, while the sum is 43.
The spelling of 145817071261 in words is "one hundred forty-five billion, eight hundred seventeen million, seventy-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •