Properties of the Number 4926

Four Thousand Nine Hundred Twenty-Six

Basics

Value: 4925 → 4926 → 4927

Parity: even

Prime: No

Previous Prime: 4919

Next Prime: 4931

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 821

Divisors: 1, 2, 3, 6, 821, 1642, 2463, 4926

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001100111110

Octal: 11476

Duodecimal: 2A26

Hexadecimal: 133e

Square: 24265476

Square Root: 70.18546858146635

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

Indices of squares (of primes) in the semiprimes. A128301

Number of integer partitions of n with integer reverse-alternating product. A347445

Triangle read by rows: T(n,k) = number of noncommutative symmetric polynomials of degree n that have exactly k different variables appearing in each monomial and which generate the algebra of all noncommutative symmetric polynomials (n >= 1, 1 <= k <= n). A55105

Values of the difference d for 5 primes in arithmetic progression with the minimal start sequence {5 + j·d}, j = 0 to 4. A206039

Triangle T(k,n) giving number of symmetric polynomials of degree n in k noncommuting variables, n >=2, 2 <= k <= n. A55107

G.f.: ∑_n>=0 xⁿ * (1+x)^n². A121689

Triangle T(n,k) giving number of symmetric polynomials of degree n in k noncommuting variables, n >=2, 2 <= k <= n. A55106

Number of distinct minimal unary DFA's with exactly n states. A59412

O.g.f.: exp( ∑_n>=1 (σ(2·n²)-σ(n²)) * xⁿ/n ). A195584

T(n,k)=Number of length n 0..k arrays with new values introduced in order from both ends. A245163