Properties of the Number 4917

Four Thousand Nine Hundred Seventeen

Basics

Value: 4916 → 4917 → 4918

Parity: odd

Prime: No

Previous Prime: 4909

Next Prime: 4919

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 149

Divisors: 1, 3, 11, 33, 149, 447, 1639, 4917

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001100110101

Octal: 11465

Duodecimal: 2A19

Hexadecimal: 1335

Square: 24176889

Square Root: 70.12132343303284

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) = ∑_{1 <= i < j <= n} (j-i)³. A24166

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3⁴.6 2D tiling (cf. A250120). A299254

a(n) = n*(9·n + 1)/2. A22267

a(n) = ∑_k=0..n (k+1) * A026615(n,k). A26960

3 times 9-gonal (or nonagonal) numbers: a(n) = 3·n*(7·n-5)/2. A152759

T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors. A200871

Number of ways to write n as an ordered sum of 6 primes. A340962

Number of primes less than 10ⁿ having at least one digit 1. A91645

Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways. A13583

Triangle T(n,k) with the coefficient [x^k] of the series (1-x)ⁿ⁺¹ * ∑_j>=0 binomial(n+3·j,3·j)*x^j, in row n, column k. A178618