Base | Representation |
---|---|
bin | 10001100000111… |
… | …00111100000001 |
3 | 101020110021012201 |
4 | 20300130330001 |
5 | 300102403134 |
6 | 22324553201 |
7 | 3432535525 |
oct | 1060347401 |
9 | 336407181 |
10 | 146919169 |
11 | 75a28601 |
12 | 41252801 |
13 | 24590827 |
14 | 15725d85 |
15 | cd71914 |
hex | 8c1cf01 |
146919169 has 2 divisors, whose sum is σ = 146919170. Its totient is φ = 146919168.
The previous prime is 146919163. The next prime is 146919197. The reversal of 146919169 is 961919641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 142563600 + 4355569 = 11940^2 + 2087^2 .
It is a cyclic number.
It is not a de Polignac number, because 146919169 - 23 = 146919161 is a prime.
It is a super-2 number, since 2×1469191692 = 43170484439301122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (146919161) 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, 73459584 + 73459585.
It is an arithmetic number, because the mean of its divisors is an integer number (73459585).
Almost surely, 2146919169 is an apocalyptic number.
It is an amenable number.
146919169 is a deficient number, since it is larger than the sum of its proper divisors (1).
146919169 is an equidigital number, since it uses as much as digits as its factorization.
146919169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 104976, while the sum is 46.
The square root of 146919169 is about 12121.0217803616. The cubic root of 146919169 is about 527.6664572044. Note that the first 3 decimals are identical.
The spelling of 146919169 in words is "one hundred forty-six million, nine hundred nineteen thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •