Base | Representation |
---|---|
bin | 10001011110100… |
… | …00010111111001 |
3 | 101012212100000121 |
4 | 20233100113321 |
5 | 300012334221 |
6 | 22314133241 |
7 | 3430061314 |
oct | 1057202771 |
9 | 335770017 |
10 | 146605561 |
11 | 75833a23 |
12 | 41121221 |
13 | 244b0b6b |
14 | 1568397b |
15 | cd0da41 |
hex | 8bd05f9 |
146605561 has 2 divisors, whose sum is σ = 146605562. Its totient is φ = 146605560.
The previous prime is 146605553. The next prime is 146605583. The reversal of 146605561 is 165506641.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140280336 + 6325225 = 11844^2 + 2515^2 .
It is an emirp because it is prime and its reverse (165506641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146605561 - 23 = 146605553 is a prime.
It is a super-2 number, since 2×1466055612 = 42986381032249442, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (146605061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73302780 + 73302781.
It is an arithmetic number, because the mean of its divisors is an integer number (73302781).
Almost surely, 2146605561 is an apocalyptic number.
It is an amenable number.
146605561 is a deficient number, since it is larger than the sum of its proper divisors (1).
146605561 is an equidigital number, since it uses as much as digits as its factorization.
146605561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 146605561 is about 12108.0783363835. The cubic root of 146605561 is about 527.2907442507.
The spelling of 146605561 in words is "one hundred forty-six million, six hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •