Properties of the Number 18605

Eighteen Thousand Six Hundred Five

Basics

Value: 18604 → 18605 → 18606

Parity: odd

Prime: No

Previous Prime: 18593

Next Prime: 18617

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 61 ²

Divisors: 1, 5, 61, 305, 3721, 18605

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100100010101101

Octal: 44255

Duodecimal: A925

Hexadecimal: 48ad

Square: 346146025

Square Root: 136.40014662748717

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

Numbers k such that σ(k) = ψ(k) + τ(k). A387953

Number of integer partitions of n such that every orderless pair of distinct parts has a different sum. A325857

a(n) = 25·n² - 36·n + 13. A154355

Number of Fibonacci binary words of length n having no 0110 subword. A Fibonacci binary word is a binary word having no 00 subword. A130137

Numbers of the form p²*q, with odd primes p > q, such that q divides p-1. A350638

Numerators of the partial sums of the reciprocals of the alternating sum of divisors function (A206369). A379619

a(n) = (5·n + 1)² + 4·n + 1. A7533

Coefficient of·in the reduction by x²->x+1 of the polynomial p(n,x) defined at Comments. A193049

Triangle read by rows, T(n,k) = ∑_j=0..n-k+1 P(n,j)*T(n-j,k-1) if k>0 else 0ⁿ where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n. A257566

Numbers n such that n | 7ⁿ + 6ⁿ + 5ⁿ + 4ⁿ + 3ⁿ. A57255