Base | Representation |
---|---|
bin | 10001011100101… |
… | …00101101000101 |
3 | 101012101220202121 |
4 | 20232110231011 |
5 | 244432024112 |
6 | 22305005541 |
7 | 3425022625 |
oct | 1056245505 |
9 | 335356677 |
10 | 146361157 |
11 | 75687338 |
12 | 410238b1 |
13 | 24426847 |
14 | 1561c885 |
15 | ccb1407 |
hex | 8b94b45 |
146361157 has 2 divisors, whose sum is σ = 146361158. Its totient is φ = 146361156.
The previous prime is 146361133. The next prime is 146361179. The reversal of 146361157 is 751163641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144144036 + 2217121 = 12006^2 + 1489^2 .
It is an emirp because it is prime and its reverse (751163641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146361157 - 227 = 12143429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146361107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73180578 + 73180579.
It is an arithmetic number, because the mean of its divisors is an integer number (73180579).
Almost surely, 2146361157 is an apocalyptic number.
It is an amenable number.
146361157 is a deficient number, since it is larger than the sum of its proper divisors (1).
146361157 is an equidigital number, since it uses as much as digits as its factorization.
146361157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15120, while the sum is 34.
The square root of 146361157 is about 12097.9815258579. The cubic root of 146361157 is about 526.9975683618.
The spelling of 146361157 in words is "one hundred forty-six million, three hundred sixty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •