1406
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 2280
- Proper Divisor Sum (Aliquot Sum)
- 874
- 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
- 648
- Möbius Function
- -1
- Radical
- 1406
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 171
- 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) = n^2*Product_{p|n} (1 + 1/p).at n=36A000082
- Semi-meanders: number of ways a semi-infinite directed curve can cross a straight line n times.at n=9A000682
- a(n) = (3*n+1)*(3*n+2).at n=12A001504
- Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).at n=37A002378
- a(n) = 2*n*(2*n-1).at n=19A002939
- Number of coprime chains with largest member n.at n=70A003139
- Number of coprime chains with largest member prime(n).at n=19A003140
- a(n) = 1 + Sum_{i=1..n} (n-i+1)*phi(i).at n=23A005598
- a(n) is the smallest positive integer a for which there is an identity of the form a*n*x = Sum_{i=1..m} ai*gi(x)^n where a1, ..., am are in Z and g1(x), ..., gm(x) are in Z[x].at n=37A005729
- A subclass of 2n-node trivalent planar graphs without triangles.at n=6A006798
- Number of simplicial 4-clusters with n cells.at n=7A007175
- Coordination sequence T2 for Zeolite Code ATS.at n=27A008039
- Coordination sequence T1 for Zeolite Code CAS.at n=23A008063
- Coordination sequence T1 for Zeolite Code LIO.at n=26A008129
- a(n) = lcm(n, sigma(n)).at n=36A009242
- If a, b in sequence, so is a*b+2.at n=48A009299
- Coordination sequence T1 for Zeolite Code -CLO.at n=33A009850
- n*prevprime(n).at n=35A013637
- Positive nonsquare integers k such that each term of the regular continued fraction of sqrt(k) divides k.at n=36A013654
- Place where n-th 1 occurs in A023122.at n=47A022784