10026
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21762
- Proper Divisor Sum (Aliquot Sum)
- 11736
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3336
- Möbius Function
- 0
- Radical
- 3342
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- Numbers k such that 187*2^k+1 is prime.at n=10A032470
- Number of times the digit 5 appears in the first 10^n digits of Pi.at n=4A099296
- Expansion of g.f. x*(-1-x-3*x^2-x^3+2*x^5)/((2*x^3+x^2-1)*(x^4+1)).at n=23A107851
- Triangle read by rows: T(n,k) (0<=k<=n) is the number of Schroeder paths of length 2n, having k (1,0)-steps on the lines y=0 and y=1 (a Schroeder path of length 2n is a path from (0,0) to (2n,0), consisting of steps U=(1,1), D=(1,-1) and H=(2,0) and never going below the x-axis).at n=38A110189
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (2,3,3,...) and super- and subdiagonals (1,1,1,...).at n=50A124733
- Ulam's spiral (WNW spoke).at n=25A143859
- Number of distinct lines passing through at least two points in a triangular grid of side n.at n=18A244504
- Relative of Hofstadter Q-sequence: a(n) = max(0, n+10000) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) + a(n-a(n-4)) for n > 0.at n=32A283889
- Relative of Hofstadter Q-sequence: a(n) = max(0, n+10001) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) + a(n-a(n-4)) for n > 0.at n=31A283890
- Relative of Hofstadter Q-sequence.at n=29A283891
- Relative of Hofstadter Q-sequence.at n=28A283892
- Indices of primes in A000219.at n=31A285216
- Number of partitions of n with n kinds of 1.at n=8A292463
- a(n) = n! * [x^n] exp((n + 1)*x + x^2/2).at n=5A301741
- Numbers that set a record for the number of distinct composite numbers that can be obtained by permuting some subset of their digits.at n=30A307623
- Number of partitions of n with eight kinds of 1.at n=8A320754
- Mark each point on the n X n X n X n grid with the number of points that are visible from it; a(n) is the number of distinct values in the grid.at n=41A339947
- Lexicographically earliest sequence of distinct nonnegative terms such that the Levenshtein distance (Ld) between a(n) and a(n+1) is equal to 5.at n=55A367815
- a(n) is the first number that has exactly n anagrams that each have exactly n prime divisors, counted by multiplicity.at n=6A369203
- Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into exactly k parts with 0 <= k <= n.at n=59A382340