Properties of the Number 8438

Eight Thousand Four Hundred Thirty-Eight

Basics

Value: 8437 → 8438 → 8439

Parity: even

Prime: No

Previous Prime: 8431

Next Prime: 8443

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 4219

Divisors: 1, 2, 4219, 8438

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000011110110

Octal: 20366

Duodecimal: 4A72

Hexadecimal: 20f6

Square: 71199844

Square Root: 91.85858696931932

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

Sum of the smallest parts of the partitions of n into 9 parts. A326465

a(n) = Fibonacci(n)*a(n-1) + 1, a(0) = 0. A176343

a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k. A24847

a(n) = number of 9-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..80]. A178884

Number of partitions of n in which any two parts differ by at most 9. A218511

Number of n X 3 arrays with each row a permutation of 1..3 having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order. A222001

Number of partitions of n such that the least part occurs exactly (1/4)*(number of parts) times. A386361

Number of partitions of n into parts that are odd or == +- 2 (mod 10). A133153

a(n) = a(n-1) + A073053(a(n-1)). A173578

Parameters n for which the Tate-Shafarevich group Ш of the elliptic curve y²=x³-n has order 16. A179140