1099
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1264
- Proper Divisor Sum (Aliquot Sum)
- 165
- 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
- 936
- Möbius Function
- 1
- Radical
- 1099
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 31
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- One-half the number of permutations of length n with exactly 4 rising or falling successions.at n=8A001268
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^7 in powers of x.at n=34A001485
- a(n) = n^3 + n^2 - 1.at n=9A003777
- a(n) = 1000*log(n) rounded to the nearest integer.at n=2A004241
- a(n) = ceiling(1000*log(n)).at n=2A004242
- Representation degeneracies for boson strings.at n=20A005294
- Positions of remoteness 5 in Beans-Don't-Talk.at n=37A005697
- Number of directed site animals on hexagonal lattice.at n=11A006861
- Primitive modest numbers.at n=43A007627
- Coordination sequence T2 for Zeolite Code AFT.at n=25A008027
- Coordination sequence T1 for Zeolite Code EAB.at n=24A008082
- Coordination sequence T2 for Zeolite Code PHI.at n=24A008228
- Expansion of g.f.: x^4/((1-x)*(1-x^2)^2*(1-x^3)).at n=43A008763
- Coordination sequence T3 for Zeolite Code RTH.at n=23A009895
- Triangle read by rows: T(n,k) is one-half the number of permutations of length n with exactly n-k rising or falling successions, for n >= 1, 1 <= k <= n. T(1,1) = 1 by convention.at n=31A010028
- Positive integers n such that 2^n == 2^7 (mod n).at n=37A015927
- Coordination sequence T3 for Zeolite Code CGF.at n=23A019453
- Coordination sequence T4 for Zeolite Code CGF.at n=23A019454
- Pseudoprimes to base 12.at n=10A020140
- Pseudoprimes to base 13.at n=12A020141