Properties of the Number 17901

Seventeen Thousand Nine Hundred One

Basics

Value: 17900 → 17901 → 17902

Parity: odd

Prime: No

Previous Prime: 17891

Next Prime: 17903

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 13 × 17

Divisors: 1, 3, 9, 13, 17, 27, 39, 51, 81, 117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100010111101101

Octal: 42755

Duodecimal: A439

Hexadecimal: 45ed

Square: 320445801

Square Root: 133.79461872586654

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

Octagonal pyramidal numbers: a(n) = n*(n+1)*(2·n-1)/2. A2414

a(n) = binomial(n,4) + binomial(n,2). A55795

a(n) = n*(31·n-1)/2. A22288

3 times 10-gonal (or decagonal) numbers: a(n) = 3·n*(4·n-3). A152767

Dimensions of the irreducible representations of the simple Lie algebra of type F4 over the complex numbers, listed in increasing order. A121738

For any number n take the polynomial formed by the product of the terms (x-π), where π's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is equal to zero. A203614

Positions of zeros in A165597. A165598

Numbers·such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of σ(x) and all cyclic permutations of Euler totient function φ(x). A247317

Number of partitions of n with difference -1 between the number of odd parts and the number of even parts, both counted without multiplicity. A242691

Odd octagonal pyramidal numbers. A218326