Base | Representation |
---|---|
bin | 1100001011111… |
… | …0010110101111 |
3 | 10120011201120201 |
4 | 3002332112233 |
5 | 101041030333 |
6 | 5023254331 |
7 | 1160303443 |
oct | 302762657 |
9 | 116151521 |
10 | 51111343 |
11 | 2693a788 |
12 | 1514a3a7 |
13 | a7871ca |
14 | 6b06823 |
15 | 474917d |
hex | 30be5af |
51111343 has 4 divisors (see below), whose sum is σ = 52760128. Its totient is φ = 49462560.
The previous prime is 51111331. The next prime is 51111373. The reversal of 51111343 is 34311115.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34311115 = 5 ⋅6862223.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51111343 is a prime.
It is a super-2 number, since 2×511113432 = 5224738766527298, which contains 22 as substring.
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 51111343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51111373) 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, 824346 + ... + 824407.
It is an arithmetic number, because the mean of its divisors is an integer number (13190032).
Almost surely, 251111343 is an apocalyptic number.
51111343 is a deficient number, since it is larger than the sum of its proper divisors (1648785).
51111343 is a wasteful number, since it uses less digits than its factorization.
51111343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1648784.
The product of its digits is 180, while the sum is 19.
The square root of 51111343 is about 7149.2197476368. The cubic root of 51111343 is about 371.1126550793.
Adding to 51111343 its reverse (34311115), we get a palindrome (85422458).
The spelling of 51111343 in words is "fifty-one million, one hundred eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •