Base | Representation |
---|---|
bin | 10001011111110… |
… | …00100101000001 |
3 | 101020011200220212 |
4 | 20233320211001 |
5 | 300033121431 |
6 | 22321443505 |
7 | 3431345402 |
oct | 1057704501 |
9 | 336150825 |
10 | 146770241 |
11 | 75936722 |
12 | 411a0595 |
13 | 2453aac7 |
14 | 156c79a9 |
15 | cd4272b |
hex | 8bf8941 |
146770241 has 2 divisors, whose sum is σ = 146770242. Its totient is φ = 146770240.
The previous prime is 146770219. The next prime is 146770279. The reversal of 146770241 is 142077641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115455025 + 31315216 = 10745^2 + 5596^2 .
It is a cyclic number.
It is not a de Polignac number, because 146770241 - 26 = 146770177 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 146770198 and 146770207.
It is not a weakly prime, because it can be changed into another prime (146770441) 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, 73385120 + 73385121.
It is an arithmetic number, because the mean of its divisors is an integer number (73385121).
Almost surely, 2146770241 is an apocalyptic number.
It is an amenable number.
146770241 is a deficient number, since it is larger than the sum of its proper divisors (1).
146770241 is an equidigital number, since it uses as much as digits as its factorization.
146770241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9408, while the sum is 32.
The square root of 146770241 is about 12114.8768462581. The cubic root of 146770241 is about 527.4881031735.
The spelling of 146770241 in words is "one hundred forty-six million, seven hundred seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •