Base | Representation |
---|---|
bin | 10001011011101… |
… | …00101110100101 |
3 | 101012011021002122 |
4 | 20231310232211 |
5 | 244413331211 |
6 | 22302115325 |
7 | 3423636026 |
oct | 1055645645 |
9 | 335137078 |
10 | 146230181 |
11 | 755a7999 |
12 | 40b7bb45 |
13 | 243ac046 |
14 | 155c6c4d |
15 | cc876db |
hex | 8b74ba5 |
146230181 has 2 divisors, whose sum is σ = 146230182. Its totient is φ = 146230180.
The previous prime is 146230177. The next prime is 146230187. The reversal of 146230181 is 181032641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143185156 + 3045025 = 11966^2 + 1745^2 .
It is a cyclic number.
It is not a de Polignac number, because 146230181 - 22 = 146230177 is a prime.
It is a super-2 number, since 2×1462301812 = 42766531670585522, which contains 22 as substring.
It is a Chen prime.
It is equal to p8244071 and since 146230181 and 8244071 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 146230181.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146230187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73115090 + 73115091.
It is an arithmetic number, because the mean of its divisors is an integer number (73115091).
Almost surely, 2146230181 is an apocalyptic number.
It is an amenable number.
146230181 is a deficient number, since it is larger than the sum of its proper divisors (1).
146230181 is an equidigital number, since it uses as much as digits as its factorization.
146230181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 146230181 is about 12092.5671798837. The cubic root of 146230181 is about 526.8403211918.
The spelling of 146230181 in words is "one hundred forty-six million, two hundred thirty thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.044 sec. • engine limits •