Properties of the Number 19432

Nineteen Thousand Four Hundred Thirty-Two

Basics

Value: 19431 → 19432 → 19433

Parity: even

Prime: No

Previous Prime: 19429

Next Prime: 19433

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 7 × 347

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 347, 694

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100101111101000

Octal: 45750

Duodecimal: B2B4

Hexadecimal: 4be8

Square: 377602624

Square Root: 139.398708745813

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+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252811

"DHK[ 6 ]" (bracelet, identity, unlabeled, 6 parts) transform of 1,1,1,1,... A32247

Number of binary rooted trees with n nodes and internal path length n. A108643

Relative of Hofstadter Q-sequence: a(n) = max(0, n+19395) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A283886

Sequence whose Hankel transform is the Somos (4) sequence. A173992

Positive numbers k such that k² - 1 divides 8^k - 1. A272062

Numbers n such that φ(n) = ∑_j=1..k d(n^j) for some k, where φ(n) is the Euler totient function of n and d(n) is the number of divisors of n. A283757

a(n) equals the sum of path counts in the (right-aligned Ferrers plots of) the partitions of n. A180684

Number of (n+2)X(1+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252804

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