Properties of the Number 19734

Nineteen Thousand Seven Hundred Thirty-Four

Basics

Value: 19733 → 19734 → 19735

Parity: even

Prime: No

Previous Prime: 19727

Next Prime: 19739

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 11 × 13 × 23

Divisors: 1, 2, 3, 6, 11, 13, 22, 23, 26, 33

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110100010110

Octal: 46426

Duodecimal: B506

Hexadecimal: 4d16

Square: 389430756

Square Root: 140.47775624631822

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

Fifth partial sums of cubes (A000578). A101102

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302322

a(n) = number of steps to reach 0 when starting from k = (n³)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261228

Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5). A36887

Number of partitions p of n such that (number of even numbers in p) = 2*(number of odd numbers in p). A241643

Partial sums of A051865. A50441

Triangle read by rows: T(n,k)=number of ordered trees with n edges and k branch nodes at odd height. A91958

Expansion of ∏_k>=1 (1 - x^k)¹³. A10820

Number of distinct sets of nonnegative integers with perimeter n, as defined in the comments. A182372

Central elements in 4-Pascal triangle A028275 (by row). A28283