Properties of the Number 10615

Ten Thousand Six Hundred Fifteen

Basics

Value: 10614 → 10615 → 10616

Parity: odd

Prime: No

Previous Prime: 10613

Next Prime: 10627

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 11 × 193

Divisors: 1, 5, 11, 55, 193, 965, 2123, 10615

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100101110111

Octal: 24567

Duodecimal: 6187

Hexadecimal: 2977

Square: 112678225

Square Root: 103.02912209661888

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

Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of ∑_i=1..n r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}. A70893

Numbers k such that 6·k+1, 6·k+7, 6·k+13, 6·k+19 are consecutive primes. A90839

Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes. A90833

T(n,k) = Number of n X k binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two no more than once. A268781

G.f.: ∑_n>=0 (xⁿ - 1)ⁿ * xⁿ / (1-x)ⁿ⁺¹. A243919

Number of undirected circular permutations i₀, i₁, ..., i_n of 0, 1, ..., n such that all the n+1 numbers |i₀²-i₁²|, |i₁²-i₂²|, ..., |i_n-1²-i_n²|, |i_n²-i₀²| are of the form (p-1)/2 with p an odd prime. A229005

a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4). A26043

T(n, 2·n-5), T given by A027960. A27967

a(n) = ∑_i=0..n digsum₃(i)⁴, where digsum₃(i) = A053735(i). A231505

Expansion of 1 / (1 - x - x⁴ + x⁹) in powers of x. A233522