ℕ atory
Play Now

Properties of the Number 20335

Twenty Thousand Three Hundred Thirty-Five

Basics

Value: 20334 → 20335 → 20336

Parity: odd

Prime: No

Previous Prime: 20333

Next Prime: 20341

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 7 2 × 83

Divisors: 1, 5, 7, 35, 49, 83, 245, 415, 581, 2905

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111101101111

Octal: 47557

Duodecimal: B927

Hexadecimal: 4f6f

Square: 413512225

Square Root: 142.60084151224353

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

Sums of lists produced by a variant of the iteration that produces the Catalan numbers: start with 0 and at each iteration replace each integer k with the list 0,1,...,k-1,k,k+1,k,k-1,...,1,0 and let a(n) be the sum of the resulting (flattened) list after n iterations. A65096
Triangular array formed by the little Schröder numbers s(n,k). A110440
Capped binary boundary codes for holeless strictly non-overlapping polyhexes (all orientations and rotations included). A258002
Capped binary boundary codes for fusenes (all orientations and rotations included). A258012
G.f.: (1 + x3 + x4 + ... + x12 + x15)/∏i=1..10 (1 - xi). A3403
Number of equivalence classes of ballot paths of length n for the string ddd. A274111
Those terms of A255571 whose every A080541/A080542-rotation is also a term of A255571. A258001
Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 29 ones. A31797
Numbers k such that k and k+1 have the same sum of squarefree divisors, or sqf(k) = sqf(k+1), where sqf(k) = A048250(k). A63964
Total number of different ways to fill m labeled boxes with balls which belong to the specifications provided by all the integer partitions [n] of n. Empty boxes are not allowed. Total number of possible preferential arrangements (or hierarchical orderings) of n elements if the elements may belong to c=1 up to c=n different classes (or specifications). A137383