10802
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17712
- Proper Divisor Sum (Aliquot Sum)
- 6910
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4900
- Möbius Function
- -1
- Radical
- 10802
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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
- Number of points on surface of hexagonal prism: 12*n^2 + 2 for n > 0 (coordination sequence for W(2)).at n=30A005914
- Oscillates under partition transform.at n=51A007210
- a(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=20A010017
- Number of incongruent ways to tile a 4 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=55A068929
- Even elements of A082931.at n=39A082933
- Multiples of 11 with digit sum 11, with no zero digits in odd places.at n=15A083512
- a(0)=2, a(1)=1, a(n+2)=floor[(e-1/e)*a(n+1)+a(n-2)].at n=10A085421
- a(n) = 2*sum(C(n,2k+1)*F(2k), k=0..floor((n-1)/2)), where F(n) are Fibonacci numbers A000045.at n=10A097040
- Number of points in the standard root system version of the D_3 (or f.c.c.) lattice having L_infinity norm n.at n=30A110907
- Numbers n such that P(11*n) is prime where P(n) is the partition number.at n=18A113499
- a(n) = A153801(n)/2.at n=24A153804
- Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^2 equal to n^2*49.at n=12A184245
- a(n) = [x^n] Product_{k=1..n} (1+x^k)^3 / x^k.at n=6A258798
- a(n) = A000787(n) + 1.at n=41A259984
- Numbers with digit sum 11 that are multiples of 11.at n=23A283742
- a(n) is the number of distinct products p of Fibonacci numbers such that Fibonacci(n) < p <= Fibonacci(n + 1).at n=42A286948
- Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.3.4.3.4 2D tiling (cf. A219529).at n=45A299255
- Expansion of 1/(1 - Sum_{k>=1} lambda(k)*x^k), where lambda() is the Liouville function (A008836).at n=33A307076
- Number of compositions of n with all adjacent parts (x, y) satisfying x >= 2y or y = 2x.at n=35A342335
- a(n) = 32*n^2 - 40*n + 10.at n=18A343578