Base | Representation |
---|---|
bin | 10001010010111… |
… | …10011111101101 |
3 | 101010000100210202 |
4 | 20221132133231 |
5 | 244120344131 |
6 | 22221443245 |
7 | 3411151331 |
oct | 1051363755 |
9 | 333010722 |
10 | 145090541 |
11 | 74999742 |
12 | 40710525 |
13 | 240a03bb |
14 | 153ab7c1 |
15 | cb0ebcb |
hex | 8a5e7ed |
145090541 has 2 divisors, whose sum is σ = 145090542. Its totient is φ = 145090540.
The previous prime is 145090501. The next prime is 145090553.
145090541 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113337316 + 31753225 = 10646^2 + 5635^2 .
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145090541 is a prime.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145090501) 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, 72545270 + 72545271.
It is an arithmetic number, because the mean of its divisors is an integer number (72545271).
Almost surely, 2145090541 is an apocalyptic number.
It is an amenable number.
145090541 is a deficient number, since it is larger than the sum of its proper divisors (1).
145090541 is an equidigital number, since it uses as much as digits as its factorization.
145090541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
The square root of 145090541 is about 12045.3535024922. The cubic root of 145090541 is about 525.4681127962.
The spelling of 145090541 in words is "one hundred forty-five million, ninety thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •