Properties of the Number 59115

Fifty-Nine Thousand One Hundred Fifteen

Basics

Value: 59114 → 59115 → 59116

Parity: odd

Prime: No

Previous Prime: 59113

Next Prime: 59119

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 7 × 563

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 563, 1689

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1110011011101011

Octal: 163353

Duodecimal: 2A263

Hexadecimal: e6eb

Square: 3494583225

Square Root: 243.13576454318687

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 read by rows: a(1,1) = 1. a(m,m) = sum of all terms in rows 1 through m-1. a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1), for n < m. A159927

The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2ⁿ)*(2ⁿ+1)/2, the 2ⁿ -th triangular number. Sequence contains the triangle read by rows. A112358

Triangle read by rows: T(n,k) is the number of graphs with n vertices and skewness k (n >= 1 and k >= 0). A294224

a(n) is the number of cyclic permutations that admit a [1,1,-1]-gridding. A303980

a(n) is the number of cyclic permutations of length n that admit a [1,-1,-1]-gridding. A304201

Expansion of e.g.f.: ((1-x)/(1-2·x))*exp(x/(1-x)). A59115