Base | Representation |
---|---|
bin | 10001011010101… |
… | …01001101000101 |
3 | 101011220200222102 |
4 | 20231111031011 |
5 | 244400213221 |
6 | 22255241445 |
7 | 3422560421 |
oct | 1055251505 |
9 | 334820872 |
10 | 146101061 |
11 | 75519987 |
12 | 40b19285 |
13 | 24365342 |
14 | 15591b81 |
15 | cc5e30b |
hex | 8b55345 |
146101061 has 2 divisors, whose sum is σ = 146101062. Its totient is φ = 146101060.
The previous prime is 146101027. The next prime is 146101073. The reversal of 146101061 is 160101641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127012900 + 19088161 = 11270^2 + 4369^2 .
It is a cyclic number.
It is not a de Polignac number, because 146101061 - 226 = 78992197 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73050530 + 73050531.
It is an arithmetic number, because the mean of its divisors is an integer number (73050531).
Almost surely, 2146101061 is an apocalyptic number.
It is an amenable number.
146101061 is a deficient number, since it is larger than the sum of its proper divisors (1).
146101061 is an equidigital number, since it uses as much as digits as its factorization.
146101061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 146101061 is about 12087.2271840981. The cubic root of 146101061 is about 526.6852103620.
The spelling of 146101061 in words is "one hundred forty-six million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •