Base | Representation |
---|---|
bin | 1010110011011… |
… | …0011000100101 |
3 | 10011021001201122 |
4 | 2230312120211 |
5 | 43044432100 |
6 | 4255103325 |
7 | 1060066400 |
oct | 254663045 |
9 | 104231648 |
10 | 45311525 |
11 | 23639246 |
12 | 13211b45 |
13 | 950636c |
14 | 6036d37 |
15 | 3ea0985 |
hex | 2b36625 |
45311525 has 36 divisors (see below), whose sum is σ = 66835008. Its totient is φ = 30371040.
The previous prime is 45311521. The next prime is 45311527. The reversal of 45311525 is 52511354.
45311525 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 45311525 - 22 = 45311521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45311494 and 45311503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45311521) 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 35 ways as a sum of consecutive naturals, for example, 57182 + ... + 57968.
It is an arithmetic number, because the mean of its divisors is an integer number (1856528).
Almost surely, 245311525 is an apocalyptic number.
It is an amenable number.
45311525 is a deficient number, since it is larger than the sum of its proper divisors (21523483).
45311525 is a wasteful number, since it uses less digits than its factorization.
45311525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858 (or 846 counting only the distinct ones).
The product of its digits is 3000, while the sum is 26.
The square root of 45311525 is about 6731.3835873467. The cubic root of 45311525 is about 356.5082297244.
Adding to 45311525 its reverse (52511354), we get a palindrome (97822879).
The spelling of 45311525 in words is "forty-five million, three hundred eleven thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •