Properties of the Number 12165

Twelve Thousand One Hundred Sixty-Five

Basics

Value: 12164 → 12165 → 12166

Parity: odd

Prime: No

Previous Prime: 12163

Next Prime: 12197

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 811

Divisors: 1, 3, 5, 15, 811, 2433, 4055, 12165

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10111110000101

Octal: 27605

Duodecimal: 7059

Hexadecimal: 2f85

Square: 147987225

Square Root: 110.29505881951376

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

Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2·j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 9, read by rows. A153654

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2·j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows. A153656

Numbers k such that k³ divides 14^k² + 1. A177814

Number of partitions of n where the difference between consecutive parts is at most 8. A238868

Array read by antidiagonals: T(n,k) is the number of rooted strong triangulations of a disk with n interior nodes and 3+k nodes on the boundary. A341856

Number of finite sets of positive integers whose right half (exclusive) sums to n. A360954

Number of partitions of n into 9 or more parts. A347545

Number of integer compositions of n into odd parts covering an initial interval of odd positive integers. A356604

a(n) = n*(27·n + 1)/2. A22285

Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k³, ordered by increasing i; sequence gives j values. A54222