10195
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12240
- Proper Divisor Sum (Aliquot Sum)
- 2045
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8152
- Möbius Function
- 1
- Radical
- 10195
- 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
- 179
- 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
- no
- Odd
- yes
Appears in sequences
- Number of strict 5th-order maximal independent sets in path graph.at n=52A007385
- Triangle giving T(n,r) = number of equivalence classes of Boolean functions of n variables and range r=0..2^n under action of symmetric group.at n=42A052265
- Number of balanced numbers <= 2^n.at n=32A078662
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=42A108403
- Where records occur in A117831.at n=18A118474
- Triangle read by rows, where t(n,1) = 1, t(n,m) = t(n,m-1) + (largest noncomposite {1 or prime} in row {n-1}).at n=42A120852
- Number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock summing to 4.at n=6A183626
- Number of (n+1) X 8 0..2 arrays with every 2 X 2 subblock summing to 4.at n=2A183630
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 4.at n=38A183632
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 4.at n=42A183632
- Number of (n+3)X5 binary arrays with no more than one of any consecutive four bits set in any row or column.at n=2A203042
- Number of (n+3)X6 binary arrays with no more than one of any consecutive four bits set in any row or column.at n=1A203043
- T(n,k)=Number of (n+3)X(k+3) binary arrays with no more than one of any consecutive four bits set in any row or column.at n=7A203048
- T(n,k)=Number of (n+3)X(k+3) binary arrays with no more than one of any consecutive four bits set in any row or column.at n=8A203048
- Sum of distinct residues of all factorials mod prime(n).at n=40A210185
- Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=21A213318
- Number of simple well-covered graphs on n nodes.at n=8A222626
- Number of compositions (ordered partitions) of n into squarefree parts (A005117) such that no two adjacent parts are equal (Carlitz compositions).at n=20A301500
- Number of partitions of n with up to seven distinct kinds of 1.at n=21A320694
- Number of colored integer partitions of n using all colors of a 3-set such that a color pattern for part i has i distinct colors in increasing order.at n=15A327842