Base | Representation |
---|---|
bin | 10001100001000… |
… | …10000100011111 |
3 | 101020111100001022 |
4 | 20300202010133 |
5 | 300104041231 |
6 | 22325234355 |
7 | 3432654026 |
oct | 1060420437 |
9 | 336440038 |
10 | 146940191 |
11 | 75a42382 |
12 | 412629bb |
13 | 2459a278 |
14 | 1572d8bd |
15 | cd77c7b |
hex | 8c2211f |
146940191 has 2 divisors, whose sum is σ = 146940192. Its totient is φ = 146940190.
The previous prime is 146940173. The next prime is 146940193. The reversal of 146940191 is 191049641.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 146940191 - 226 = 79831327 is a prime.
It is a super-2 number, since 2×1469401912 = 43182839462232962, which contains 22 as substring.
Together with 146940193, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146940193) 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, 73470095 + 73470096.
It is an arithmetic number, because the mean of its divisors is an integer number (73470096).
Almost surely, 2146940191 is an apocalyptic number.
146940191 is a deficient number, since it is larger than the sum of its proper divisors (1).
146940191 is an equidigital number, since it uses as much as digits as its factorization.
146940191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The square root of 146940191 is about 12121.8889204612. Note that the first 3 decimals coincide. The cubic root of 146940191 is about 527.6916231405.
The spelling of 146940191 in words is "one hundred forty-six million, nine hundred forty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •