Properties of the Number 11901

Eleven Thousand Nine Hundred One

Basics

Value: 11900 → 11901 → 11902

Parity: odd

Prime: No

Previous Prime: 11897

Next Prime: 11903

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 3967

Divisors: 1, 3, 3967, 11901

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10111001111101

Octal: 27175

Duodecimal: 6A79

Hexadecimal: 2e7d

Square: 141633801

Square Root: 109.09170454255447

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

Centered 20-gonal (or icosagonal) numbers. A69133

Add/multiply sequence, see example. A93361

Array read by descending antidiagonals: T(n,k) is the number of achiral colorings of the facets of a regular n-dimensional orthoplex using up to k colors. A325015

Integers k such that all the digits needed to write the consecutive nonnegative integers from 0 to k fill exactly a square (no holes, no overlaps). A158022

55 'Reverse and Add' steps are needed to reach a palindrome. A65322

Number of achiral colorings of the 8 triangular faces of a regular octahedron or the 8 vertices of a cube using n or fewer colors. A337897

Square array T(n, k) = ∏_j=1..n ( ∑_i=0..j-1 ( (k+1)⁶ -(k+1)⁵ -(k+1)⁴ +(k+1)² )ⁱ ) with T(n, 0) = n!, read by antidiagonals. A156889

L.g.f.: ∑_n>=1 a(n)*xⁿ/n = ∑_n>=1 xⁿ/n·exp( ∑_k>=1 σ(n·k)*x^n·k/k ). A203321

Least k such that 10^2n-1+k is a brilliant number. A84476

Number n such that a2 - n³ is a triangular number (A000217), where a2 is the least square above n³. A233400