Base | Representation |
---|---|
bin | 10001010110110… |
… | …01101010010101 |
3 | 101010221222211111 |
4 | 20223121222111 |
5 | 244233020104 |
6 | 22240335021 |
7 | 3415352206 |
oct | 1053315225 |
9 | 333858744 |
10 | 145595029 |
11 | 75203778 |
12 | 40914471 |
13 | 24218c08 |
14 | 1549d5ad |
15 | cbae404 |
hex | 8ad9a95 |
145595029 has 2 divisors, whose sum is σ = 145595030. Its totient is φ = 145595028.
The previous prime is 145594997. The next prime is 145595039. The reversal of 145595029 is 920595541.
145595029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116596804 + 28998225 = 10798^2 + 5385^2 .
It is an emirp because it is prime and its reverse (920595541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145595029 - 25 = 145594997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145594982 and 145595000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145595039) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72797514 + 72797515.
It is an arithmetic number, because the mean of its divisors is an integer number (72797515).
Almost surely, 2145595029 is an apocalyptic number.
It is an amenable number.
145595029 is a deficient number, since it is larger than the sum of its proper divisors (1).
145595029 is an equidigital number, since it uses as much as digits as its factorization.
145595029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 40.
The square root of 145595029 is about 12066.2765176338. The cubic root of 145595029 is about 526.0764357109.
The spelling of 145595029 in words is "one hundred forty-five million, five hundred ninety-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •