Properties of the Number 11305

Eleven Thousand Three Hundred Five

Basics

Value: 11304 → 11305 → 11306

Parity: odd

Prime: No

Previous Prime: 11299

Next Prime: 11311

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 5 × 7 × 17 × 19

Divisors: 1, 5, 7, 17, 19, 35, 85, 95, 119, 133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110000101001

Octal: 26051

Duodecimal: 6661

Hexadecimal: 2c29

Square: 127803025

Square Root: 106.32497354808042

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

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

Number of compositions (ordered partitions) of n into distinct parts. A32020

a(n) = ∑_{d divides n} q(d), where q(d) = A000009 = number of partitions of d into distinct parts. A47966

Smallest order of cyclotomic polynomial containing n or -n as a coefficient. A13594

Infinite square array read by antidiagonals downwards: T(0,m) = prime(m), m >= 1; for n >= 1, T(n,m) = T(n-1,m)*T(n-1,m+1)/gcd(T(n-1,m), T(n-1,m+1))², m >= 1. A255483

Sarrus numbers A001567 that are not Carmichael numbers A002997. A153508

Indices of records in heights of cyclotomic polynomials (A160338). A160340

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0. A263816

Odd interprimes divisible by 17. A124620

Odd interprimes divisible by 19. A126231