Base | Representation |
---|---|
bin | 10001100000101… |
… | …10000010111001 |
3 | 101020101211111002 |
4 | 20300112002321 |
5 | 300101002222 |
6 | 22324214345 |
7 | 3432360314 |
oct | 1060260271 |
9 | 336354432 |
10 | 146890937 |
11 | 75a09376 |
12 | 4123a3b5 |
13 | 24580a1b |
14 | 1571997b |
15 | cd68392 |
hex | 8c160b9 |
146890937 has 2 divisors, whose sum is σ = 146890938. Its totient is φ = 146890936.
The previous prime is 146890921. The next prime is 146890951. The reversal of 146890937 is 739098641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141039376 + 5851561 = 11876^2 + 2419^2 .
It is a cyclic number.
It is not a de Polignac number, because 146890937 - 24 = 146890921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146890891 and 146890900.
It is not a weakly prime, because it can be changed into another prime (146890637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73445468 + 73445469.
It is an arithmetic number, because the mean of its divisors is an integer number (73445469).
Almost surely, 2146890937 is an apocalyptic number.
It is an amenable number.
146890937 is a deficient number, since it is larger than the sum of its proper divisors (1).
146890937 is an equidigital number, since it uses as much as digits as its factorization.
146890937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 47.
The square root of 146890937 is about 12119.8571361217. The cubic root of 146890937 is about 527.6326562289.
The spelling of 146890937 in words is "one hundred forty-six million, eight hundred ninety thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •