Properties of the Number 21467

Twenty-One Thousand Four Hundred Sixty-Seven

Basics

Value: 21466 → 21467 → 21468

Parity: odd

Prime: Yes

Previous Prime: 21433

Next Prime: 21481

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 21467

Divisors: 1, 21467

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001111011011

Octal: 51733

Duodecimal: 1050B

Hexadecimal: 53db

Square: 460832089

Square Root: 146.5162107072115

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

Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6·n. A52356

Primes of the form k² + k + 5. A27755

Number of partitions of n with exactly five part sizes. A365631

Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime: (2), (1, 4), (3, 5, 9), (6, 7, 8, 10), (11, 12, 13, 14, 17), (15, 16, 18, 19, 20, 21), ... Sequence gives group sums. A75345

The number of conjugacy classes of invertible n X n matrices over GF(2) which are squares of other such matrices. A266462

a(n) is the number of edges in the graph PG(n) with one node for each free n-celled polyiamond and edges between nodes corresponding to polyiamonds that can be obtained from each other by moving one cell, where the intermediate polyform (the set of cells remaining when the cell to be moved is detached) is required to be a connected polyiamond. A389964

Convolution of Fibonacci numbers and primes. A23615

Second term p(m) of strong prime sextets: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3). A54814

Sixth term of weak prime sextet: p(m-4)-p(m-5) < p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1). A54833

Primes p such that the largest prime factor of p⁵ + 1 is less than p. A102327