4681
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
- 4864
- Proper Divisor Sum (Aliquot Sum)
- 183
- 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
- 4500
- Möbius Function
- 1
- Radical
- 4681
- 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
- 46
- 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
- sigma_3(n): sum of cubes of divisors of n.at n=15A001158
- Strong pseudoprimes to base 2.at n=3A001262
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=15A001567
- Numerators of the Taylor coefficients of (e^x-1)^2.at n=14A002678
- Hex (or centered hexagonal) numbers: 3*n*(n+1)+1 (crystal ball sequence for hexagonal lattice).at n=39A003215
- Divisors of 2^15 - 1.at n=6A003526
- Divisors of 2^30 - 1.at n=33A003538
- Divisors of 2^45 - 1.at n=11A003550
- Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=9A006970
- Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=7A006971
- q-Fibonacci numbers for q=8, scaling a(n-2).at n=5A015465
- Expansion of x/(1 - 8*x - 3*x^2).at n=5A015574
- Numerator of sum of -3rd powers of divisors of n.at n=15A017669
- Cyclotomic polynomials at x=8.at n=5A019326
- Fermat pseudoprimes to base 4.at n=30A020136
- Pseudoprimes to base 16.at n=39A020144
- Pseudoprimes to base 19.at n=27A020147
- Pseudoprimes to base 23.at n=37A020151
- Pseudoprimes to base 33.at n=20A020161
- Pseudoprimes to base 38.at n=32A020166