Base | Representation |
---|---|
bin | 10001010110001… |
… | …00101010101101 |
3 | 101010210121212121 |
4 | 20223010222231 |
5 | 244222242122 |
6 | 22234432541 |
7 | 3414543412 |
oct | 1053045255 |
9 | 333717777 |
10 | 145509037 |
11 | 75155103 |
12 | 40892751 |
13 | 241b8a2b |
14 | 1547a109 |
15 | cb93bc7 |
hex | 8ac4aad |
145509037 has 8 divisors (see below), whose sum is σ = 152220600. Its totient is φ = 138910464.
The previous prime is 145509019. The next prime is 145509047. The reversal of 145509037 is 730905541.
It can be written as a sum of positive squares in 4 ways, for example, as 1052676 + 144456361 = 1026^2 + 12019^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-145509037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145508993 and 145509011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145509047) 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 in 7 ways as a sum of consecutive naturals, for example, 25608 + ... + 30769.
It is an arithmetic number, because the mean of its divisors is an integer number (19027575).
Almost surely, 2145509037 is an apocalyptic number.
It is an amenable number.
145509037 is a deficient number, since it is larger than the sum of its proper divisors (6711563).
145509037 is an equidigital number, since it uses as much as digits as its factorization.
145509037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56495.
The product of its (nonzero) digits is 18900, while the sum is 34.
The square root of 145509037 is about 12062.7126717003. The cubic root of 145509037 is about 525.9728440924.
The spelling of 145509037 in words is "one hundred forty-five million, five hundred nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •