Base | Representation |
---|---|
bin | 10001010011000… |
… | …10101010110101 |
3 | 101010001020020221 |
4 | 20221202222311 |
5 | 244121421022 |
6 | 22222054341 |
7 | 3411252223 |
oct | 1051425265 |
9 | 333036227 |
10 | 145107637 |
11 | 74a00574 |
12 | 4071a3b1 |
13 | 240a810c |
14 | 153b3b13 |
15 | cb14cc7 |
hex | 8a62ab5 |
145107637 has 2 divisors, whose sum is σ = 145107638. Its totient is φ = 145107636.
The previous prime is 145107623. The next prime is 145107643. The reversal of 145107637 is 736701541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 145106116 + 1521 = 12046^2 + 39^2 .
It is an emirp because it is prime and its reverse (736701541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145107637 - 27 = 145107509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145107607) 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, 72553818 + 72553819.
It is an arithmetic number, because the mean of its divisors is an integer number (72553819).
Almost surely, 2145107637 is an apocalyptic number.
It is an amenable number.
145107637 is a deficient number, since it is larger than the sum of its proper divisors (1).
145107637 is an equidigital number, since it uses as much as digits as its factorization.
145107637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 34.
The square root of 145107637 is about 12046.0631328248. The cubic root of 145107637 is about 525.4887505992.
The spelling of 145107637 in words is "one hundred forty-five million, one hundred seven thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •