Base | Representation |
---|---|
bin | 10001010111101… |
… | …00111101101101 |
3 | 101011011200020102 |
4 | 20223310331231 |
5 | 244300104421 |
6 | 22243000445 |
7 | 3416326226 |
oct | 1053647555 |
9 | 334150212 |
10 | 145706861 |
11 | 7527a7a3 |
12 | 40969125 |
13 | 24257aa1 |
14 | 154cc24d |
15 | cbd260b |
hex | 8af4f6d |
145706861 has 2 divisors, whose sum is σ = 145706862. Its totient is φ = 145706860.
The previous prime is 145706807. The next prime is 145706893. The reversal of 145706861 is 168607541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139381636 + 6325225 = 11806^2 + 2515^2 .
It is a cyclic number.
It is not a de Polignac number, because 145706861 - 210 = 145705837 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 (145703861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72853430 + 72853431.
It is an arithmetic number, because the mean of its divisors is an integer number (72853431).
Almost surely, 2145706861 is an apocalyptic number.
It is an amenable number.
145706861 is a deficient number, since it is larger than the sum of its proper divisors (1).
145706861 is an equidigital number, since it uses as much as digits as its factorization.
145706861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 145706861 is about 12070.9097005984. The cubic root of 145706861 is about 526.2110948947.
Subtracting from 145706861 its product of nonzero digits (40320), we obtain a palindrome (145666541).
The spelling of 145706861 in words is "one hundred forty-five million, seven hundred six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •