Base | Representation |
---|---|
bin | 1100001010110… |
… | …0111100101001 |
3 | 10120001002202220 |
4 | 3002230330221 |
5 | 101031240131 |
6 | 5021544253 |
7 | 1156555533 |
oct | 302547451 |
9 | 116032686 |
10 | 51040041 |
11 | 268a1158 |
12 | 15115089 |
13 | a760910 |
14 | 6ac8853 |
15 | 4732e96 |
hex | 30acf29 |
51040041 has 8 divisors (see below), whose sum is σ = 73288320. Its totient is φ = 31409232.
The previous prime is 51040037. The next prime is 51040051. The reversal of 51040041 is 14004015.
51040041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51040041 - 22 = 51040037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51040041.
It is not an unprimeable number, because it can be changed into a prime (51040021) 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 7 ways as a sum of consecutive naturals, for example, 654321 + ... + 654398.
It is an arithmetic number, because the mean of its divisors is an integer number (9161040).
Almost surely, 251040041 is an apocalyptic number.
It is an amenable number.
51040041 is a deficient number, since it is larger than the sum of its proper divisors (22248279).
51040041 is a wasteful number, since it uses less digits than its factorization.
51040041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1308735.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 51040041 is about 7144.2313092452. The cubic root of 51040041 is about 370.9400033272.
Adding to 51040041 its reverse (14004015), we get a palindrome (65044056).
The spelling of 51040041 in words is "fifty-one million, forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •