Base | Representation |
---|---|
bin | 10001100001000… |
… | …00110100011101 |
3 | 101020111002000121 |
4 | 20300200310131 |
5 | 300103410234 |
6 | 22325154541 |
7 | 3432633061 |
oct | 1060406435 |
9 | 336432017 |
10 | 146935069 |
11 | 75a39546 |
12 | 4125ba51 |
13 | 24597b38 |
14 | 1572baa1 |
15 | cd764b4 |
hex | 8c20d1d |
146935069 has 2 divisors, whose sum is σ = 146935070. Its totient is φ = 146935068.
The previous prime is 146935039. The next prime is 146935073. The reversal of 146935069 is 960539641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102779044 + 44156025 = 10138^2 + 6645^2 .
It is a cyclic number.
It is not a de Polignac number, because 146935069 - 27 = 146934941 is a prime.
It is a super-2 number, since 2×1469350692 = 43179829004069522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146935039) 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, 73467534 + 73467535.
It is an arithmetic number, because the mean of its divisors is an integer number (73467535).
Almost surely, 2146935069 is an apocalyptic number.
It is an amenable number.
146935069 is a deficient number, since it is larger than the sum of its proper divisors (1).
146935069 is an equidigital number, since it uses as much as digits as its factorization.
146935069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 43.
The square root of 146935069 is about 12121.6776479166. The cubic root of 146935069 is about 527.6854916937.
The spelling of 146935069 in words is "one hundred forty-six million, nine hundred thirty-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •