Properties of the Number 56135

Fifty-Six Thousand One Hundred Thirty-Five

Basics

Value: 56134 → 56135 → 56136

Parity: odd

Prime: No

Previous Prime: 56131

Next Prime: 56149

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 103 × 109

Divisors: 1, 5, 103, 109, 515, 545, 11227, 56135

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101101101000111

Octal: 155507

Duodecimal: 2859B

Hexadecimal: db47

Square: 3151138225

Square Root: 236.92825918408298

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

Array read by upwards antidiagonals: T(m,n) = number of set partitions of the multiset consisting of one copy each of x₁, x₂, ..., x_m, and two copies each of y₁, y₂, ..., y_n, for m >= 0, n >= 0. A322765

G.f.: ∑_k>=1 x^2·k-1/(1+x^2·k-1) * ∏_k>=1 1/(1-x^k). A305123

Row 1 of array in A322765. A322766

Number of partitions of the (n+5)-multiset {1,2,...,n,1,2,...,5}. A346882

Number of partitions of the (n+6)-multiset {1,2,...,n,1,2,...,6}. A346883

Minimal natural number (in decimal representation) with n prime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime). A217306

Number of self-inverse permutations in S_n with longest increasing subsequence of length 7. A217327

E.g.f.: exp(exp(x) - ∑_i=0..5 xⁱ/i!). A293025

Number A(n,k) of partitions of the (n+k)-multiset {1,2,...,n,1,2,...,k}; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346500

Smallest positive integer other than n where geometric mean of n and a(n) is an integer. A56135