10378
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15570
- Proper Divisor Sum (Aliquot Sum)
- 5192
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5188
- Möbius Function
- 1
- Radical
- 10378
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 104
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 85.at n=8A020424
- a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027948.at n=23A027959
- a(n) is the least number with exactly n permutations of digits that are primes.at n=26A046893
- Number of permutations of length n which avoid the patterns 1234, 2341, 3421.at n=9A116818
- Expansion of 1/(1 - x - x^3 + x^5).at n=44A123552
- A106486-encodings of combinatorial games with value -1.at n=27A125993
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (0, -1), (1, -1), (1, 0), (1, 1)}.at n=9A151475
- Maximal length of rook tour on an n X n+2 board.at n=23A152133
- Semiprimes which have one or more occurrences of exactly five different digits.at n=15A235693
- Number of n-celled polyominoes which are of square type.at n=11A259088
- Composite numbers n such that Sum_{k = 0..n} (-1)^k * C(n,k) * C(2*n,k) == -1 (mod n^3) (see A234839).at n=20A268303
- G.f.: 1 + Sum_{n>=1} a(n)*x^n/(1 - x^n) = 1/(1 - x/(1 - 2*x/(1 - 3*x/(1 - 4*x/(1 - ...))))).at n=5A286310
- Row sums of A291955.at n=55A291956
- The number of trees with 4 nodes labeled by positive integers, where each tree's label sum is n.at n=43A301739
- a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/2)} 3^k * a(k) * a(n-2*k-1).at n=11A352007
- a(n) is the least positive integer that has exactly n anagrams that are semiprimes, or -1 if there is no such integer.at n=30A362499
- Number of free polyominoids with n cells, allowing right-angled corner-connections and any edge-connections.at n=4A366005
- Triangle read by rows: T(n,k) is the number of free polyominoes with n cells whose difference between length and width is k, n >= 1, k >= 0.at n=66A379625