Properties of the Number 23450

Twenty-Three Thousand Four Hundred Fifty

Basics

Value: 23449 → 23450 → 23451

Parity: even

Prime: No

Previous Prime: 23447

Next Prime: 23459

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 ² × 7 × 67

Divisors: 1, 2, 5, 7, 10, 14, 25, 35, 50, 67

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101110011010

Octal: 55632

Duodecimal: 116A2

Hexadecimal: 5b9a

Square: 549902500

Square Root: 153.13392831113555

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 subset-sums of strict integer partitions of n. A365925

Lexicographically first sequence of distinct terms such that any set of six successive digits can be reordered as {d, d+1, d+2, d+3, d+4, d+5}, d being the smallest of the six digits. A302501

a(n) is the number of terms in the expansion of (x-y)*(x⁴-y⁴)*(x⁹-y⁹)*...*(x^n²-y^n²). A225549

Number of binary strings of length n with equal numbers of 01001 and 10010 substrings. A164259

Numbers n such that n+(n+1), n²+(n+1)², n+(n+1)², n²+(n+1) are all prime. A216270

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 718", based on the 5-celled von Neumann neighborhood. A273427

a(n) is the smallest number not occurring earlier whose concatenation with the previous term contains the smallest possible number of numeric substrings strictly larger than for the preceding term; a(0) = 0. A307511

Least number m such that 9·k*m+1 is prime for k=1..n. A372238

Integers are written in the form abcd...n where "a" means "At position a in this integer there is a digit b"; "b" means: "at position b there is a digit c"; "c" means: "at position c there is a digit d"; ... and "n" means nothing. No repetitions are allowed (like in the integer 111). A105958

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (0, 0, 1), (1, 0, 0)}. A149909