Base | Representation |
---|---|
bin | 1100001011111… |
… | …1101100101001 |
3 | 10120012000010100 |
4 | 3002333230221 |
5 | 101041214331 |
6 | 5023340013 |
7 | 1160325456 |
oct | 302775451 |
9 | 116160110 |
10 | 51116841 |
11 | 26943926 |
12 | 15151609 |
13 | a789869 |
14 | 6b0882d |
15 | 474aae6 |
hex | 30bfb29 |
51116841 has 24 divisors (see below), whose sum is σ = 79474824. Its totient is φ = 31541760.
The previous prime is 51116837. The next prime is 51116881. The reversal of 51116841 is 14861115.
It can be written as a sum of positive squares in 4 ways, for example, as 17139600 + 33977241 = 4140^2 + 5829^2 .
It is not a de Polignac number, because 51116841 - 22 = 51116837 is a prime.
It is a super-2 number, since 2×511168412 = 5225862867638562, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51116801) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6595 + ... + 12071.
It is an arithmetic number, because the mean of its divisors is an integer number (3311451).
Almost surely, 251116841 is an apocalyptic number.
51116841 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
51116841 is a deficient number, since it is larger than the sum of its proper divisors (28357983).
51116841 is a wasteful number, since it uses less digits than its factorization.
51116841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5561 (or 5558 counting only the distinct ones).
The product of its digits is 960, while the sum is 27.
The square root of 51116841 is about 7149.6042547822. The cubic root of 51116841 is about 371.1259613508.
Adding to 51116841 its reverse (14861115), we get a palindrome (65977956).
The spelling of 51116841 in words is "fifty-one million, one hundred sixteen thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •