9102
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 10050
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- 1
- Radical
- 9102
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 184
- 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
- a(n) = Sum_t t*F(n,t), where F(n,t) is the number of forests with n (unlabeled) nodes and exactly t trees, all of which are planted (that is, rooted trees in which the root has degree 1).at n=12A005199
- a(n) = (n-1)*n*(n+4)/6.at n=37A005581
- Coordination sequence for MgZn2, Position Zn2.at n=24A009938
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2*n+3)*(2*n-1).at n=19A030440
- Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 2,0,3.at n=6A037618
- (s(n)+1)/10, where s(n)=n-th base 10 palindrome that starts with 9.at n=32A043088
- Partial sums of A048655.at n=9A048746
- a(n+1) = a(n) converted to base 10 from base 14.at n=14A055985
- Number of fixed points in all 231-avoiding involutions in S_n.at n=11A059570
- n is divisible by the sum of all divisors of n which are less than the square root of n (values of n where 1 is the only divisor less than sqrt(n) are excluded as trivial cases.).at n=39A088345
- Representative lunar primes.at n=31A088574
- Total number of smallest parts in all partitions of n into odd parts.at n=40A092268
- Numbers k such that the k-th and (k+1)-th primes have the same sum of squares of digits.at n=38A109182
- Number of reduced words of length n in the Weyl group B_37.at n=3A162165
- Number of reduced words of length n in the Weyl group D_37.at n=3A162389
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=15A166537
- Monotonic ordering of set S generated by these rules: if x and y are in S then (x+1)(y+1) is in S, and 2 is in S.at n=35A192518
- Expansion of chi(x)^2 / chi(-x^2)^6 in powers of x where chi() is a Ramanujan theta function.at n=15A224916
- Number of partitions of n such that neither the number of parts nor the number of distinct parts is a part.at n=36A241380
- Number of nX2 arrays containing 2 copies of 0..n-1 avoiding the pattern down-up in every row and equal-up in every column.at n=4A269477