Base | Representation |
---|---|
bin | 1000011110110001000… |
… | …0011000000010111001 |
3 | 111221001220210210201122 |
4 | 2013230100120002321 |
5 | 4341342043332122 |
6 | 150533233555025 |
7 | 13345344322355 |
oct | 2075420300271 |
9 | 457056723648 |
10 | 145697636537 |
11 | 56876576872 |
12 | 242a1a15a75 |
13 | 1097c11326b |
14 | 70a2210465 |
15 | 3bcb030142 |
hex | 21ec4180b9 |
145697636537 has 2 divisors, whose sum is σ = 145697636538. Its totient is φ = 145697636536.
The previous prime is 145697636503. The next prime is 145697636549. The reversal of 145697636537 is 735636796541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104425276201 + 41272360336 = 323149^2 + 203156^2 .
It is an emirp because it is prime and its reverse (735636796541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145697636537 - 220 = 145696587961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145697636537.
It is not a weakly prime, because it can be changed into another prime (145697636437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72848818268 + 72848818269.
It is an arithmetic number, because the mean of its divisors is an integer number (72848818269).
Almost surely, 2145697636537 is an apocalyptic number.
It is an amenable number.
145697636537 is a deficient number, since it is larger than the sum of its proper divisors (1).
145697636537 is an equidigital number, since it uses as much as digits as its factorization.
145697636537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 85730400, while the sum is 62.
The spelling of 145697636537 in words is "one hundred forty-five billion, six hundred ninety-seven million, six hundred thirty-six thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •