Base | Representation |
---|---|
bin | 10001010101010… |
… | …11101001100001 |
3 | 101010121102022012 |
4 | 20222223221201 |
5 | 244211002221 |
6 | 22232322305 |
7 | 3413635556 |
oct | 1052535141 |
9 | 333542265 |
10 | 145406561 |
11 | 75095113 |
12 | 40843395 |
13 | 241811b1 |
14 | 15450a2d |
15 | cb7365b |
hex | 8aaba61 |
145406561 has 2 divisors, whose sum is σ = 145406562. Its totient is φ = 145406560.
The previous prime is 145406557. The next prime is 145406587. The reversal of 145406561 is 165604541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80442961 + 64963600 = 8969^2 + 8060^2 .
It is an emirp because it is prime and its reverse (165604541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145406561 - 22 = 145406557 is a prime.
It is a super-2 number, since 2×1454065612 = 42286135963693442, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (145408561) 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, 72703280 + 72703281.
It is an arithmetic number, because the mean of its divisors is an integer number (72703281).
Almost surely, 2145406561 is an apocalyptic number.
It is an amenable number.
145406561 is a deficient number, since it is larger than the sum of its proper divisors (1).
145406561 is an equidigital number, since it uses as much as digits as its factorization.
145406561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 145406561 is about 12058.4642886232. The cubic root of 145406561 is about 525.8493414511.
The spelling of 145406561 in words is "one hundred forty-five million, four hundred six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •