Properties of the Number 11965

Eleven Thousand Nine Hundred Sixty-Five

Basics

Value: 11964 → 11965 → 11966

Parity: odd

Prime: No

Previous Prime: 11959

Next Prime: 11969

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 2393

Divisors: 1, 5, 2393, 11965

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10111010111101

Octal: 27275

Duodecimal: 6B11

Hexadecimal: 2ebd

Square: 143161225

Square Root: 109.38464243210744

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

a(n) = (a(n-1)+a(n-2))/7^k, where 7^k is the highest power of 7 dividing a(n-1)+a(n-2). A78414

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A300215

Number of condensed integer partitions of n into parts > 1. A370805

Number of nonnegative solutions of x1² + x2² + ... + x10² = n. A45852

a(n) = 169·n² + 140·n + 29. A156640

Positive numbers y such that y² is of the form x²+(x+47)² with integer x. A159750

Sum of the remainders when n² is divided by squares less than n. A67459

Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k. A241049

Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = (2k+1)² - 2 (A073577). A293620

Number of n X 3 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A300210