Base | Representation |
---|---|
bin | 1010110110101… |
… | …0010010110001 |
3 | 10011122212101110 |
4 | 2231222102301 |
5 | 43123233040 |
6 | 4303423533 |
7 | 1061643312 |
oct | 255522261 |
9 | 104585343 |
10 | 45524145 |
11 | 23773a67 |
12 | 132b4ba9 |
13 | 957c084 |
14 | 6090609 |
15 | 3ee3980 |
hex | 2b6a4b1 |
45524145 has 32 divisors (see below), whose sum is σ = 75640320. Its totient is φ = 23362560.
The previous prime is 45524131. The next prime is 45524159. The reversal of 45524145 is 54142554.
45524145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (45524131) and next prime (45524159).
It is not a de Polignac number, because 45524145 - 212 = 45520049 is a prime.
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 48117 + ... + 49053.
It is an arithmetic number, because the mean of its divisors is an integer number (2363760).
Almost surely, 245524145 is an apocalyptic number.
It is an amenable number.
45524145 is a deficient number, since it is larger than the sum of its proper divisors (30116175).
45524145 is a wasteful number, since it uses less digits than its factorization.
With its successor (45524146) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (1065).
45524145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065.
The product of its digits is 16000, while the sum is 30.
The square root of 45524145 is about 6747.1582907177. The cubic root of 45524145 is about 357.0649867178.
Adding to 45524145 its reverse (54142554), we get a palindrome (99666699).
The spelling of 45524145 in words is "forty-five million, five hundred twenty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •