Properties of the Number 15767

Fifteen Thousand Seven Hundred Sixty-Seven

Basics

Value: 15766 → 15767 → 15768

Parity: odd

Prime: Yes

Previous Prime: 15761

Next Prime: 15773

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 15767

Divisors: 1, 15767

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110110010111

Octal: 36627

Duodecimal: 915B

Hexadecimal: 3d97

Square: 248598289

Square Root: 125.56671533491668

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 permutations in S_n with longest increasing subsequence of length <= 3 (i.e., 1234-avoiding permutations); vexillary permutations (i.e., 2143-avoiding). A5802

Number of permutations A(n,k) in S_n with longest increasing subsequence of length <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A214015

Balanced primes of order five. A96697

Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals. A47888

Primes p such that p - 6², p - 6, p + 6 and p + 6² are also primes. A141279

Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2143. 0 <= k <= A028723(n + 1). A342862

Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 1243. 0 <= k <= A028723(n + 1). A342863

Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 1432. 0 <= k <= A100354(n). A342864

Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n). A47887

Numbers that cannot be written as a difference of 11-smooth numbers. A326319