1407
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
- 8
- Divisor Sum
- 2176
- Proper Divisor Sum (Aliquot Sum)
- 769
- 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
- 792
- Möbius Function
- -1
- Radical
- 1407
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=43A001000
- Number of sublattices of index n in generic 3-dimensional lattice.at n=36A001001
- Hit polynomials.at n=4A001886
- Central polygonal numbers: a(n) = n^2 - n + 1.at n=38A002061
- Coordination sequence T7 for Zeolite Code MFI.at n=24A008170
- Coordination sequence T6 for Zeolite Code NES.at n=24A008210
- Coefficients in expansion of sqrt(2) as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=51A011193
- a(n)=a(n-1)+a(n-4).at n=22A014098
- Expansion of 1/(1-x^8-x^9-x^10-x^11-x^12-x^13).at n=55A017871
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite VET = VPI-8 [Si17O34] starting with a T5 atom.at n=10A019251
- Convolution of A023532 and primes.at n=31A023606
- Numbers with exactly 9 ones in binary expansion.at n=11A023691
- a(n) = 2nd elementary symmetric function of {1, prime(1), prime(2), ..., prime(n-1)}, where prime(0) = 1.at n=6A024522
- Least m such that if r and s in {Pi/2 - atn(h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k.at n=42A024832
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=20A024835
- a(n) = Sum_{k=0..n} (k+1) * T(n, k), with T given by A026300.at n=6A026943
- Coordination sequence T2 for Zeolite Code SAT.at n=27A027374
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 24.at n=13A031522
- Numbers k such that 165*2^k+1 is prime.at n=32A032459
- Numbers whose set of base-5 digits is {1,2}.at n=47A032926