Base | Representation |
---|---|
bin | 1010110110011… |
… | …1000110000101 |
3 | 10011122012102021 |
4 | 2231213012011 |
5 | 43122323140 |
6 | 4303243141 |
7 | 1061560156 |
oct | 255470605 |
9 | 104565367 |
10 | 45511045 |
11 | 23765138 |
12 | 132a94b1 |
13 | 9576118 |
14 | 608992d |
15 | 3edeb4a |
hex | 2b67185 |
45511045 has 4 divisors (see below), whose sum is σ = 54613260. Its totient is φ = 36408832.
The previous prime is 45511021. The next prime is 45511079. The reversal of 45511045 is 54011554.
It is a happy number.
45511045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6548481 + 38962564 = 2559^2 + 6242^2 .
It is a cyclic number.
It is not a de Polignac number, because 45511045 - 25 = 45511013 is a prime.
It is a congruent 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 3 ways as a sum of consecutive naturals, for example, 4551100 + ... + 4551109.
It is an arithmetic number, because the mean of its divisors is an integer number (13653315).
Almost surely, 245511045 is an apocalyptic number.
It is an amenable number.
45511045 is a deficient number, since it is larger than the sum of its proper divisors (9102215).
45511045 is an equidigital number, since it uses as much as digits as its factorization.
45511045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9102214.
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 45511045 is about 6746.1874418074. The cubic root of 45511045 is about 357.0307338317.
Adding to 45511045 its reverse (54011554), we get a palindrome (99522599).
The spelling of 45511045 in words is "forty-five million, five hundred eleven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •