Base | Representation |
---|---|
bin | 1100010000111… |
… | …1000101111001 |
3 | 10120210112012210 |
4 | 3010033011321 |
5 | 101132121131 |
6 | 5034325333 |
7 | 1163151540 |
oct | 304170571 |
9 | 116715183 |
10 | 51442041 |
11 | 27046192 |
12 | 15289849 |
13 | a8718a1 |
14 | 6b91157 |
15 | 47b2146 |
hex | 310f179 |
51442041 has 16 divisors (see below), whose sum is σ = 79718400. Its totient is φ = 28896528.
The previous prime is 51442009. The next prime is 51442043. The reversal of 51442041 is 14024415.
It is a happy number.
51442041 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 51442041 - 25 = 51442009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 51441999 and 51442017.
It is not an unprimeable number, because it can be changed into a prime (51442043) 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 15 ways as a sum of consecutive naturals, for example, 19521 + ... + 21998.
It is an arithmetic number, because the mean of its divisors is an integer number (4982400).
Almost surely, 251442041 is an apocalyptic number.
It is an amenable number.
51442041 is a deficient number, since it is larger than the sum of its proper divisors (28276359).
51442041 is a wasteful number, since it uses less digits than its factorization.
51442041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41588.
The product of its (nonzero) digits is 640, while the sum is 21.
The square root of 51442041 is about 7172.3107155226. The cubic root of 51442041 is about 371.9113197679.
Adding to 51442041 its reverse (14024415), we get a palindrome (65466456).
The spelling of 51442041 in words is "fifty-one million, four hundred forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •