ℕ atory
Play Now

Properties of the Number 28434

Twenty-Eight Thousand Four Hundred Thirty-Four

Basics

Value: 28433 → 28434 → 28435

Parity: even

Prime: No

Previous Prime: 28433

Next Prime: 28439

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 677

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 677, 1354

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111100010010

Octal: 67422

Duodecimal: 14556

Hexadecimal: 6f12

Square: 808492356

Square Root: 168.6238417306402

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 (n+1)X(k+1) 0..3 arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. A184095
Number of partitions of n such that each part is no more than 3 more than the sum of all smaller parts. A286929
Expansion of e.g.f. exp( exp(3*(exp(x)-1))-1 ). A369783
a(n) is the sum of squares of the first n positive integers congruent to 2 mod 3. A24394
Number of positive integers <= 10n that are divisible by no prime exceeding 23. A108277
Number of Motzkin trees that are "uniquely closable skeletons". A300126
a(n) = numerator of ∑d∣n (pod(d)/τ(d)) where pod(k) = the product of the divisors of k (A007955) and τ(k) = the number of the divisors of k (A000005). A324982
Number of (n+1)X3 0..3 arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. A184088
Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 7. A200467
Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its four previous neighbors modulo (n+1). A200471