Properties of the Number 10484

Ten Thousand Four Hundred Eighty-Four

Basics

Value: 10483 → 10484 → 10485

Parity: even

Prime: No

Previous Prime: 10477

Next Prime: 10487

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 2621

Divisors: 1, 2, 4, 2621, 5242, 10484

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100011110100

Octal: 24364

Duodecimal: 6098

Hexadecimal: 28f4

Square: 109914256

Square Root: 102.39140588936164

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 of numbers a(n,k) = number of Young tableaux with n cells and k rows (1 <= k <= n); also number of self-inverse permutations on n letters in which the length of the longest scattered (i.e., not necessarily contiguous) increasing subsequence is k. A47884

T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean. A244903

Total number of left truncatable primes (without zeros) in base n. A76623

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal sum minus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A254804

Number T(n,k) of standard Young tableaux for partitions of n into exactly k distinct parts; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows. A219311

Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments. A108914

Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists. A344072

a(1)=1; a(n) = a(n-1) + [sum of all decimal digits present so far in the sequence]. A72921

Approximations up to 2ⁿ for the 2-adic integer log(-3). A321691

The number of primes between n and n³ (with n and n³ excluded). A117491