10426
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16884
- Proper Divisor Sum (Aliquot Sum)
- 6458
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- -1
- Radical
- 10426
- Omega Function (Ω)
- 3
- 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
- 104
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=17A020342
- Numbers k such that the continued fraction for sqrt(k) has period 29.at n=29A020368
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 8.at n=17A031421
- Expansion of (1 + x)/(1 - 2*x - x^2 + x^3).at n=11A033303
- Second differences of partition numbers A000041.at n=54A053445
- Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-6).at n=12A114358
- First of two sequences bisecting the second differences of the partition numbers (see A053445).at n=27A160644
- Number of -6..6 arrays x(0..n-1) of n elements with zero sum and no element more than one greater than the previous.at n=6A199845
- Number of -n..n arrays x(0..6) of 7 elements with zero sum and no element more than one greater than the previous.at n=5A199851
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array.at n=16A220045
- Maximal term of TRIP-Stern sequence of level n corresponding to permutation triple (e,13,e).at n=22A271485
- 34-gonal numbers: a(n) = n*(32*n-30)/2.at n=26A282854
- Numbers with digit sum 13 that are multiples of 13.at n=39A283737
- a(n) is the least number such that phi(a(n)) = phi(R(a(n)))/n, where R(n) is the digit reverse of n and phi(n) is the Euler totient function of n.at n=12A284497
- Square array T(m,n) = number of ways to draw m-1 horizontal lines [a(i),b(i)] with 0 <= a(i) < b(i) <= n such that if two lines start or end on the same coordinate, no intermediate line crosses this coordinate (see comments); m, n >= 1.at n=42A298636
- Table of distinct triples (A,B,C) such that A = B * C with B < C and A's digits being distinct and split between B and C.at n=42A331401
- E.g.f. satisfies: A(x) = exp( x * (1 + A(x)^3)/2 ).at n=5A349714
- Smallest antipalindromic natural number k such that k*A351172(n) is also antipalindromic.at n=42A351174
- Sums of the ascending diagonals of the triangle A162609.at n=50A351704
- Numbers k such that A003961(k) = 2k +- 7, multiplied by the sign of difference A003961(k)-2k, where A003961 is fully multiplicative with a(prime(i)) = prime(i+1).at n=9A379237