Base | Representation |
---|---|
bin | 1100001100000… |
… | …1111111000011 |
3 | 10120012110222101 |
4 | 3003001333003 |
5 | 101042014321 |
6 | 5023451231 |
7 | 1160365003 |
oct | 303017703 |
9 | 116173871 |
10 | 51126211 |
11 | 2694a974 |
12 | 15156b17 |
13 | a790bc6 |
14 | 6b0c003 |
15 | 474d791 |
hex | 30c1fc3 |
51126211 has 4 divisors (see below), whose sum is σ = 51142000. Its totient is φ = 51110424.
The previous prime is 51126209. The next prime is 51126233. The reversal of 51126211 is 11262115.
51126211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51126211 - 21 = 51126209 is a prime.
It is a super-2 number, since 2×511262112 = 5227778902433042, which contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (51126241) 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 3 ways as a sum of consecutive naturals, for example, 1071 + ... + 10168.
It is an arithmetic number, because the mean of its divisors is an integer number (12785500).
Almost surely, 251126211 is an apocalyptic number.
51126211 is a deficient number, since it is larger than the sum of its proper divisors (15789).
51126211 is a wasteful number, since it uses less digits than its factorization.
51126211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15788.
The product of its digits is 120, while the sum is 19.
The square root of 51126211 is about 7150.2595057802. The cubic root of 51126211 is about 371.1486364466.
Adding to 51126211 its reverse (11262115), we get a palindrome (62388326).
The spelling of 51126211 in words is "fifty-one million, one hundred twenty-six thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •