10400
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 27342
- Proper Divisor Sum (Aliquot Sum)
- 16942
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 130
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 29
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation.at n=47A003451
- Number of ways in which n identical balls can be distributed among 4 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=31A005337
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=47A023857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (natural numbers >= 2).at n=47A024853
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=46A024854
- Numbers k such that 253*2^k+1 is prime.at n=32A032503
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=6A033829
- Numbers having three 0's in base 10.at n=30A043491
- Numbers whose base-4 representation contains exactly three 0's and four 2's.at n=15A045056
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.at n=44A050769
- Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers.at n=15A057370
- a(n) = A061086(n) / n.at n=19A061087
- Numbers k that, when expressed in base 5 and then interpreted in base 8, give a multiple of k.at n=32A062930
- a(n) is the unique k such that palindrome A068065(n) = k + reverse(k).at n=15A068910
- Multiples of 5 with digit sum 5.at n=26A069540
- Binary widths of the terms of A072638.at n=15A072641
- Expansion of (1-x)^(-1)/(1-3*x-2*x^2-2*x^3).at n=7A077824
- Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.at n=14A084029
- Main diagonal of triangle A084029.at n=4A084030
- Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1 <= k <= n.at n=42A097082