1102
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1800
- Proper Divisor Sum (Aliquot Sum)
- 698
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 504
- Möbius Function
- -1
- Radical
- 1102
- 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
- 44
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).at n=36A001304
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=37A003107
- Numbers that are the sum of 10 positive 5th powers.at n=45A003355
- Number of trees with stability index n.at n=8A003429
- Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)).at n=38A006578
- Numbers in base 3.at n=38A007089
- Number of factors in the infinite word formed by the Kolakoski sequence A000002.at n=37A007782
- Coordination sequence T1 for Zeolite Code APD.at n=22A008034
- Coordination sequence T4 for Zeolite Code DAC.at n=21A008070
- If a, b are in the sequence, so is ab+3.at n=30A009302
- Coordination sequence T1 for Zeolite Code -CHI.at n=21A009846
- a(0) = 1, a(n) = 11*n^2 + 2 for n>0.at n=10A010003
- a(n) = floor( n*(n-1)*(n-2)/27 ).at n=32A011909
- Powers of fifth root of 7 rounded down.at n=18A018132
- Powers of fifth root of 7 rounded to nearest integer.at n=18A018133
- Coordination sequence T2 for Zeolite Code CGF.at n=23A019452
- Number of matchings in Moebius ladder M_n.at n=4A020877
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=7; where c( ) is complement of a( ).at n=41A022950
- Numbers with exactly 6 1's in their ternary expansion.at n=9A023697
- Base 5 expansion uses each positive digit just once.at n=40A023743