Properties of the Number 19401

Nineteen Thousand Four Hundred One

Basics

Value: 19400 → 19401 → 19402

Parity: odd

Prime: No

Previous Prime: 19391

Next Prime: 19403

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 29 × 223

Divisors: 1, 3, 29, 87, 223, 669, 6467, 19401

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101111001001

Octal: 45711

Duodecimal: B289

Hexadecimal: 4bc9

Square: 376398801

Square Root: 139.2874725163753

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

Number of equivalence classes of binary sequences of period n. A2729

E.g.f. A(x) satisfies A(x) = exp(x) + x·A(x)². A194471

The 180-degree spoke (or ray) of a hexagonal spiral of Ulam. A244806

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

Sums of 5 distinct powers of 5. A38477

k! + k# + 1 is prime, where k# is the primorial function. A81710

Number of n-node rooted identity trees of height at most 8. A38087

Consider all integer triples (i,j,k), j >= k>0, with i³=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives j values. A54209

Consider all integer triples (i,j,k), j >= k>0, with i³=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values. A54210

Number of partitions of n such that (number of distinct parts) = number of 1s. A239960