Base | Representation |
---|---|
bin | 1100001101110… |
… | …1110111010001 |
3 | 10120102021121122 |
4 | 3003131313101 |
5 | 101104143101 |
6 | 5030132025 |
7 | 1161351632 |
oct | 303356721 |
9 | 116367548 |
10 | 51240401 |
11 | 26a18743 |
12 | 151b1015 |
13 | a800b84 |
14 | 6b3b889 |
15 | 477251b |
hex | 30dddd1 |
51240401 has 4 divisors (see below), whose sum is σ = 51255204. Its totient is φ = 51225600.
The previous prime is 51240383. The next prime is 51240407. The reversal of 51240401 is 10404215.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 31348801 + 19891600 = 5599^2 + 4460^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51240401 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51240401.
It is not an unprimeable number, because it can be changed into a prime (51240407) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 881 + ... + 10161.
It is an arithmetic number, because the mean of its divisors is an integer number (12813801).
Almost surely, 251240401 is an apocalyptic number.
It is an amenable number.
51240401 is a deficient number, since it is larger than the sum of its proper divisors (14803).
51240401 is an equidigital number, since it uses as much as digits as its factorization.
51240401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14802.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 51240401 is about 7158.2400770022. The cubic root of 51240401 is about 371.4247501931.
Adding to 51240401 its reverse (10404215), we get a palindrome (61644616).
The spelling of 51240401 in words is "fifty-one million, two hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •