10197
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16224
- Proper Divisor Sum (Aliquot Sum)
- 6027
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6120
- Möbius Function
- 0
- Radical
- 3399
- 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
- 60
- 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
- no
- Odd
- yes
Appears in sequences
- Alkane (or paraffin) numbers l(8,n).at n=16A005995
- List of pairs of primes in reverse order.at n=12A007797
- a(n) is nonsquarefree and is sum of first k nonsquarefrees for some k.at n=41A013935
- Numbers k for which phi(k) + anti-phi(k) = k.at n=27A066418
- Numbers k that divide 2^(k+3) - 1.at n=38A069927
- a(n) = (4*n+3)*(4*n+7).at n=24A085027
- Numbers which are the sum of two positive cubes and divisible by 11.at n=19A101852
- First trisection of A061037 (Balmer line series of the hydrogen atom).at n=33A142590
- Triangle read by rows: T(n,k) (n >= 2, k >= 1) is the number of non-crossing connected graphs on n nodes on a circle such that the distance from a fixed node (root) to the next node is k. Rows are indexed 2,3,4,...; columns are indexed 1,2,3, ... .at n=31A143018
- a(n) = (8*n+3)*(8*n+7).at n=12A146301
- a(n) = prime(n)^2-4.at n=25A166010
- a(n) = 16n^4 + 64n^3 + 104n^2 + 80n + 21.at n=4A176711
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X 2 array.at n=8A219572
- -3-Knödel numbers.at n=22A225507
- a(n) = prime(n)^2 - 4*prime(n).at n=24A245034
- Partial sums of A234275.at n=50A265056
- Convolution of nonzero hexagonal numbers (A000384) with themselves.at n=8A271870
- Number of n-element subsets of [n+5] having an even sum.at n=16A282081
- Number of ways to write n as an ordered sum of 6 prime power palindromes (A084092).at n=22A282845
- Expansion of Product_{1 <= i <= j <= k} (1 + x^(i*j*k)).at n=37A321359