Properties of the Number 51712

Fifty-One Thousand Seven Hundred Twelve

Basics

Value: 51711 → 51712 → 51713

Parity: even

Prime: No

Previous Prime: 51691

Next Prime: 51713

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁹ × 101

Divisors: 1, 2, 4, 8, 16, 32, 64, 101, 128, 202

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101000000000

Octal: 145000

Duodecimal: 25B14

Hexadecimal: ca00

Square: 2674130944

Square Root: 227.40272645683032

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Numbers of the form p⁹*q where p and q are distinct primes. A179692

Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k. A263534

Binomial transform of A084265. A84266

Binomial transform of A073145: a(n)=Sum(binomial(n,k)*A073145(k),(k=0,..,n)). A75115

Array read by antidiagonals: T(n,m) is the number of acyclic edge sets in the complete bipartite graph K_n,m. A328887

a(2n+2) = 9·a(2n+1), a(2n+1) = 9·a(2n) - 8ⁿ*A000108(n), a(0)=1. A156566

Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533. A86860

Let L = A185064(n) be the n-th length for which a Golay sequence exists; a(n) = number of non-constructable Golay sequences of length L. A208926

Indices of primes in A266891. A304210

Greatest number in row n of array T given by A027157. A27168