Properties of the Number 61902

Sixty-One Thousand Nine Hundred Two

Basics

Value: 61901 → 61902 → 61903

Parity: even

Prime: No

Previous Prime: 61879

Next Prime: 61909

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 19 × 181

Divisors: 1, 2, 3, 6, 9, 18, 19, 38, 57, 114

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111000111001110

Octal: 170716

Duodecimal: 2B9A6

Hexadecimal: f1ce

Square: 3831857604

Square Root: 248.801125399384

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

Place two n-gons with radii 1 and 2 concentrically, forming an annular area between them. Connect all the vertices with line segments that lie entirely within that area. Then a(n) is the number of regions in that figure. A337700

Partial sums of A006010. A335648

a(n) = n*(n - 1)*(n² + 1)/2. A71252

a(n) = a(n-2)*2 + floor(sqrt(a(n-1))). A182559

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 641", based on the 5-celled von Neumann neighborhood. A273311

Sum of the largest parts in the partitions of 4n into 4 parts with smallest part = 1. A240711

Number of partitions p of n such that (number of numbers in p that have multiplicity 1) ≠ (number of numbers in p having multiplicity > 1). A330147

Rectangular table, read by antidiagonals, where row n is equal to column 0 of matrix power A121412ⁿ⁺¹ for n>=0. A121424

Number of subpartitions of partition P=[0,1,1,2,2,2,3,3,3,3,4,...] (A003056). A121430

Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n) for n>0, k>0, such that T(n,0) = T(n-1,n) for n>0 with T(0,k)=1 for k>=0. A136733