8350
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 7274
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3320
- Möbius Function
- 0
- Radical
- 1670
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 114
- 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 binary partitions: number of partitions of 2n into powers of 2.at n=48A000123
- Number of symmetric, reduced unit interval schemes with n+1 intervals (n>=1).at n=21A005213
- Construct triangle in which n-th row is obtained by expanding (1 + x + x^2)^n and take the next-to-central column.at n=9A005717
- a(n) = (5*n^2 + 1)*n^2 / 6.at n=10A008354
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 24 (most significant digit on right).at n=14A029517
- Numbers k such that k^2 is palindromic in base 3.at n=41A029984
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=1A031947
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=1A049357
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=15A049900
- a(n) = 1 + (number of partitions of n, n>0).at n=32A052810
- Smallest integer containing all digits in all bases from 2 to n.at n=4A055085
- a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2*Pi*b_i/n) = Product_{i=1..4} sin(2*Pi*c_i/n).at n=40A063781
- Tenth column of trinomial coefficients.at n=5A064054
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges and k branches.at n=64A091187
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peaks at even height.at n=56A091869
- Array read by rows: right-hand side of triangle A027907 of trinomial coefficients.at n=56A094531
- Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 1.at n=75A101276
- Number of polyominoes consisting of n regular unit 10-gons.at n=6A103468
- Number of polyominoes consisting of 7 regular unit n-gons.at n=7A103473
- Left half of trinomial triangle (A027907), triangle read by rows.at n=64A111808