10348
domain: N
Properties
Digital Properties
- Digit Count
- 5
- 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
- 19600
- Proper Divisor Sum (Aliquot Sum)
- 9252
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- 0
- Radical
- 5174
- 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
- 148
- 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
- Poincaré series [or Poincare series] for depths of roots in a certain root system.at n=19A019528
- Susceptibility series H_3 for 2-dimensional Ising model (divided by 2).at n=13A054410
- Rounded volume of a regular octahedron with edge length n.at n=28A071400
- Tetranacci numbers starting with first four cubes.at n=11A093322
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0110 (n,k >= 0).at n=48A118890
- Sum of squares of four consecutive primes.at n=13A133524
- Expansion of g.f. 1/((1-x^2+x^3+x^4-x^5)*(1-x-x^2+x^3-x^5)).at n=26A147598
- Similar to A072921 but starting with 2.at n=41A152231
- Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array B(t,r) read by rows.at n=39A177011
- Number of (n+2)X4 binary matrices with every 3X3 block having exactly four 1's.at n=4A181256
- Number of (n+2)X7 binary matrices with every 3X3 block having exactly four 1's.at n=1A181259
- T(n,k) = number of (n+2) X (k+2) binary matrices with every 3 X 3 block having exactly four 1's.at n=16A181262
- T(n,k) = number of (n+2) X (k+2) binary matrices with every 3 X 3 block having exactly four 1's.at n=19A181262
- Numerators of convergents to the general continued fraction 1/(1 + 2/(1 + 3/(1 + 4/(1+ ...)))).at n=12A225435
- Number of length n+5 0..3 arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=14A248484
- Number of (n+2) X (5+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=21A255798
- Numbers k such that 23*10^k - 7 is prime.at n=27A270738
- Maximum starting value of X such that repeated replacement of X with X-ceiling(X/5) requires n steps to reach 0.at n=37A279075
- Numbers k such that 5*10^k + 21 is prime.at n=19A281839
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 3.at n=53A284689