Base | Representation |
---|---|
bin | 10001010010010… |
… | …00011001111101 |
3 | 101002211202200122 |
4 | 20221020121331 |
5 | 244110000221 |
6 | 22215504325 |
7 | 3410323463 |
oct | 1051103175 |
9 | 332752618 |
10 | 145000061 |
11 | 74937768 |
12 | 406880a5 |
13 | 2406b16b |
14 | 15386833 |
15 | cae2eab |
hex | 8a4867d |
145000061 has 2 divisors, whose sum is σ = 145000062. Its totient is φ = 145000060.
The previous prime is 145000057. The next prime is 145000069. The reversal of 145000061 is 160000541.
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., 84456100 + 60543961 = 9190^2 + 7781^2 .
It is an emirp because it is prime and its reverse (160000541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145000061 - 22 = 145000057 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145000069) 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, 72500030 + 72500031.
It is an arithmetic number, because the mean of its divisors is an integer number (72500031).
Almost surely, 2145000061 is an apocalyptic number.
It is an amenable number.
145000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
145000061 is an equidigital number, since it uses as much as digits as its factorization.
145000061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 145000061 is about 12041.5971116792. The cubic root of 145000061 is about 525.3588609203.
The spelling of 145000061 in words is "one hundred forty-five million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •