1896
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 4800
- Proper Divisor Sum (Aliquot Sum)
- 2904
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 624
- Möbius Function
- 0
- Radical
- 474
- Omega Function (Ω)
- 5
- 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
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Convolution of A000203 with itself.at n=15A000385
- Number of free nonplanar polyenoids with n nodes and symmetry point group C_s.at n=5A000948
- Expansion of (theta_3(z)*theta_3(7z)+theta_2(z)*theta_2(7z))^3.at n=18A002653
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=34A005282
- Number of strict first-order maximal independent sets in path graph.at n=26A007383
- Coordination sequence T5 for Zeolite Code MEL.at n=28A008154
- "Pascal sweep" for k=10: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=15A009550
- Coordination sequence T3 for Zeolite Code VNI.at n=27A009909
- a(n) = 12*a(n-1) + 7*a(n-2).at n=4A015611
- Six iterations of Reverse and Add are needed to reach a palindrome.at n=35A015984
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,6).at n=11A018918
- Pisot sequences E(6,8), P(6,8).at n=20A020716
- n-th 8k+1 prime plus n-th 8k+7 prime.at n=37A022761
- Place where n-th 1 occurs in A007337.at n=46A022777
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=26A023434
- Self-convolution of natural numbers >= 3.at n=17A023551
- Coordination sequence T3 for Zeolite Code MWW.at n=30A024988
- Index of 8^n within the sequence of the numbers of the form 3^i*8^j (A025615).at n=44A025728
- a(n) = sum of the numbers between the two n's in A026346.at n=28A026349
- a(n) = n^2 + n + 4.at n=43A027689