Properties of the Number 54110

Fifty-Four Thousand One Hundred Ten

Basics

Value: 54109 → 54110 → 54111

Parity: even

Prime: No

Previous Prime: 54101

Next Prime: 54121

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 7 × 773

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 773, 1546

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101001101011110

Octal: 151536

Duodecimal: 27392

Hexadecimal: d35e

Square: 2927892100

Square Root: 232.61556267799452

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

Number of primes of the form x² + 1 < 10ⁿ. A83844

Number of primes of the form b² + 1 for b <= 10ⁿ. A206709

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock. A236505

Number of (n+1)X(2+1) 0..3 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock. A236502

Triangular array T(n,k): in Pascal's triangle, draw vertical lines through binomial(n-1,k-1) (if present) and binomial(n-1,k) (if present); then T(n,k) is the sum of binomial(i,j) that lie on or between the lines and not below binomial(n,k). A54110

a(n) = number of primes of the form P(k) = k² + 1 <= 10ⁿ as predicted by the Hardy and Littlewood Conjecture F, rounded to nearest integer. The actual number of primes is A083844(n). A331942