Properties of the Number 12458

Twelve Thousand Four Hundred Fifty-Eight

Basics

Value: 12457 → 12458 → 12459

Parity: even

Prime: No

Previous Prime: 12457

Next Prime: 12473

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 6229

Divisors: 1, 2, 6229, 12458

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11000010101010

Octal: 30252

Duodecimal: 7262

Hexadecimal: 30aa

Square: 155201764

Square Root: 111.61541112229978

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

T(n,k)=Number of 0..k arrays of length n with each element differing from at least one neighbor by 2 or more. A221524

Triangle read by rows: Each row is constructed by forming the partial sums of the previous row, reading from the right and at every third row repeating the final term. A99961

a(n) = 169·n² - 140·n + 29. A156639

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and vertical height (i.e., number of rows) k (1 <= k <= n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121692

Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments). A274471

a(n) = A273059(4n+2). A275918

CIK transform of partition numbers A000041. A55890

Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments). A274469

Number of partitions of n such that the (sum of distinct odd parts) > n/2. A284614

Number of partitions of n such that the (sum of distinct odd parts) >= n/2. A284615