Base | Representation |
---|---|
bin | 1010101111010… |
… | …0011101111101 |
3 | 10010202100100221 |
4 | 2223310131331 |
5 | 43012312113 |
6 | 4245221341 |
7 | 1054563265 |
oct | 253643575 |
9 | 103670327 |
10 | 45041533 |
11 | 23474409 |
12 | 13101851 |
13 | 94404c4 |
14 | 5da67a5 |
15 | 3e4a98d |
hex | 2af477d |
45041533 has 4 divisors (see below), whose sum is σ = 47412160. Its totient is φ = 42670908.
The previous prime is 45041531. The next prime is 45041539. The reversal of 45041533 is 33514054.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 45041533 - 21 = 45041531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45041498 and 45041507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45041531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1185285 + ... + 1185322.
It is an arithmetic number, because the mean of its divisors is an integer number (11853040).
Almost surely, 245041533 is an apocalyptic number.
It is an amenable number.
45041533 is a deficient number, since it is larger than the sum of its proper divisors (2370627).
45041533 is a wasteful number, since it uses less digits than its factorization.
45041533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2370626.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 45041533 is about 6711.2989055771. The cubic root of 45041533 is about 355.7987252816.
Adding to 45041533 its reverse (33514054), we get a palindrome (78555587).
The spelling of 45041533 in words is "forty-five million, forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •