Properties of the Number 42564

Forty-Two Thousand Five Hundred Sixty-Four

Basics

Value: 42563 → 42564 → 42565

Parity: even

Prime: No

Previous Prime: 42557

Next Prime: 42569

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 3547

Divisors: 1, 2, 3, 4, 6, 12, 3547, 7094, 10641, 14188

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011001000100

Octal: 123104

Duodecimal: 20770

Hexadecimal: a644

Square: 1811694096

Square Root: 206.31044568804558

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

Fibonacci sequence beginning 4, 14. A22383

Number of partitions of n containing the number of distinct parts as a part. A239945

Numbers m such that m·reversal(m) contains every decimal digit exactly once. A178929

Numerators of continued fraction convergents to sqrt(811). A42564

Number of nX4 0..1 arrays with each 1 adjacent to 0, 2 or 3 king-move neighboring 1s. A296670

a(0) = 0; for n > 0, if the value of n itself appears in the sequence then a(n) = a(n-1) - (n-index(n)) if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + (n-index(n)), where index(n) is the index of the last appearance of n. If the value of n does not appear then a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n. A340733