Base | Representation |
---|---|
bin | 100001010011110010110011… |
… | …110001111001101110110101 |
3 | 201012200212011110001211121221 |
4 | 201103302303301321232311 |
5 | 123200141304222011112 |
6 | 1235323120131110341 |
7 | 42566653342362121 |
oct | 4123626361715665 |
9 | 635625143054557 |
10 | 146495760735157 |
11 | 42750559886729 |
12 | 1451ba39a423b1 |
13 | 639864c845512 |
14 | 282660b2a6581 |
15 | 11e0a56d1de07 |
hex | 853cb3c79bb5 |
146495760735157 has 2 divisors, whose sum is σ = 146495760735158. Its totient is φ = 146495760735156.
The previous prime is 146495760735019. The next prime is 146495760735161. The reversal of 146495760735157 is 751537067594641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 146391463386756 + 104297348401 = 12099234^2 + 322951^2 .
It is a cyclic number.
It is not a de Polignac number, because 146495760735157 - 219 = 146495760210869 is a prime.
It is a super-2 number, since 2×1464957607351572 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146495760735187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73247880367578 + 73247880367579.
It is an arithmetic number, because the mean of its divisors is an integer number (73247880367579).
Almost surely, 2146495760735157 is an apocalyptic number.
It is an amenable number.
146495760735157 is a deficient number, since it is larger than the sum of its proper divisors (1).
146495760735157 is an equidigital number, since it uses as much as digits as its factorization.
146495760735157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 666792000, while the sum is 70.
The spelling of 146495760735157 in words is "one hundred forty-six trillion, four hundred ninety-five billion, seven hundred sixty million, seven hundred thirty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •