10398
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20808
- Proper Divisor Sum (Aliquot Sum)
- 10410
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3464
- Möbius Function
- -1
- Radical
- 10398
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- Narayana-Zidek-Capell numbers: a(n) = 1 for n <= 2. Otherwise a(2n) = 2a(2n-1), a(2n+1) = 2a(2n) - a(n).at n=16A002083
- Numbers whose set of base-15 digits is {1,3}.at n=25A032922
- Numerators of continued fraction convergents to sqrt(346).at n=8A041654
- Number of solutions to c(0)F(0) + ... + c(n)F(n) = 0, where c(i) = +-1 for i >= 0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers.at n=39A058301
- Positive integers n such that n^11 + 1 is semiprime.at n=44A105122
- Least positive k such that k*n + 1 is a golden semiprime (A108540).at n=25A108200
- Number of L-convex polyominoes with n cells, that is, convex polyominoes where any two cells can be connected by a path internal to the polyomino and which has at most 1 change of direction (i.e., one of the four orientations of the letter L).at n=14A126764
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150741
- a(n) = 36*n^2 - 6.at n=16A158462
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=31A162705
- Total sum of parts of multiplicity 9 in all partitions of n.at n=39A222737
- a(n) = 9*n^3/2 - 21*n^2/2 + 8*n - 4.at n=12A232495
- A bisection of A002083.at n=8A259858
- G.f. A(x) satisfies: 1/(1-x) = Sum_{n>=0} x^n * (1+x)^(n^2) / A(x)^(n*(n+1)/2).at n=12A325578
- Number of partitions of n whose greatest part is a multiple of 3.at n=39A363045
- The number of lit cells in weakly decreasing partitions of n when light shines from the north west. Here partitions are represented from left to right by columns of cells.at n=21A366157