Base | Representation |
---|---|
bin | 1100010010100… |
… | …0001111010001 |
3 | 10120222202111121 |
4 | 3010220033101 |
5 | 101143420131 |
6 | 5040442241 |
7 | 1164061042 |
oct | 304501721 |
9 | 116882447 |
10 | 51545041 |
11 | 27106609 |
12 | 15319381 |
13 | a8a9732 |
14 | 6bba8c9 |
15 | 47d2911 |
hex | 31283d1 |
51545041 has 4 divisors (see below), whose sum is σ = 52641792. Its totient is φ = 50448292.
The previous prime is 51545029. The next prime is 51545059. The reversal of 51545041 is 14054515.
It is a happy number.
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 51545041 - 29 = 51544529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51544997 and 51545015.
It is not an unprimeable number, because it can be changed into a prime (51545341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 548305 + ... + 548398.
It is an arithmetic number, because the mean of its divisors is an integer number (13160448).
Almost surely, 251545041 is an apocalyptic number.
It is an amenable number.
51545041 is a deficient number, since it is larger than the sum of its proper divisors (1096751).
51545041 is a wasteful number, since it uses less digits than its factorization.
51545041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1096750.
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 51545041 is about 7179.4875165293. The cubic root of 51545041 is about 372.1593745165.
Adding to 51545041 its reverse (14054515), we get a palindrome (65599556).
The spelling of 51545041 in words is "fifty-one million, five hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •