1486
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2232
- Proper Divisor Sum (Aliquot Sum)
- 746
- 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
- 742
- Möbius Function
- 1
- Radical
- 1486
- 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
- 96
- 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
- yes
- Odd
- no
Appears in sequences
- Number of different score sequences that are possible in an n-team round-robin tournament.at n=10A000571
- a(n) = 2^n - C(n,0) - ... - C(n,4).at n=11A002664
- Nonsquare values of m in the discriminant D = 4*m leading to a new maximum of the L-function of the Dirichlet series L(1) = Sum_{k>0} Kronecker(D,k)/k.at n=22A003421
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=37A004978
- Number of paraffins.at n=18A005999
- Percolation series for directed b.c.c. lattice.at n=15A006838
- Number of triangles with integer sides and area = n times perimeter.at n=41A007237
- Inverse Moebius transform of triangular numbers.at n=50A007437
- Number of n step self-avoiding walks on 3 X infinity grid starting from (0,1).at n=9A007825
- Coordination sequence T2 for Zeolite Code CAS.at n=24A008064
- Coordination sequence T3 for Zeolite Code EPI.at n=24A008092
- Coordination sequence T2 for Zeolite Code ERI.at n=28A008094
- a(n) = Sum_{k=0..6} binomial(n,k).at n=11A008859
- Triangle read by rows of partial sums of binomial coefficients: T(n,k) = Sum_{i=0..k} binomial(n,i) (0 <= k <= n); also dimensions of Reed-Muller codes.at n=72A008949
- Coordination sequence T3 for Zeolite Code -ROG.at n=29A009861
- Coordination sequence T1 for Zeolite Code ZON.at n=27A009919
- Number of labeled forests of n nodes each component of which is a path.at n=6A011800
- Five iterations of Reverse and Add are needed to reach a palindrome.at n=34A015982
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite NES = NU-87 H4[Al4Si64O136].nH2O starting with a T1 atom.at n=10A019202
- Expansion of Product_{m >= 1} (1-m*q^m)^12.at n=6A022672