4697
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 1255
- 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
- 3600
- Möbius Function
- -1
- Radical
- 4697
- 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
- 108
- 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+6) = -a(n+5) + a(n+4) + 3a(n+3) + a(n+2) - a(n+1) - a(n). a(n) = sign(n) if abs(n)<=3.at n=30A001945
- a(n) = n! - n^3.at n=7A007339
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=29A015993
- Fibonacci sequence beginning 1, 32.at n=12A022402
- Expansion of Product_{m>=1} (1+m*q^m)^-14.at n=6A022706
- Second elementary symmetric function of 3,4,...,n+3.at n=10A024183
- Expansion of 1/((1-x)^2(1-x^2)(1-x^3)(1-x^5)) in powers of x.at n=37A028291
- Numbers whose set of base-8 digits is {1,3}.at n=32A032915
- Divisors = 1 (mod 4) of Descartes's 198585576189.at n=42A033870
- Gaps of 9 in sequence A038593 (lower terms).at n=6A038657
- Numbers ending with '7' that are the difference of two positive cubes.at n=27A038862
- The sequence e when b=[ 1,1,1,0,1,1,... ].at n=52A042957
- Numbers having four 2's in base 5.at n=33A043360
- Numbers having four 1's in base 8.at n=12A043428
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=22A045107
- Restricted partitions.at n=18A049284
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = a(2) = 1 and a(3) = 2.at n=12A049939
- McKay-Thompson series of class 47A for the Monster group.at n=49A058690
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.at n=29A065217
- In base 2: smallest integer which requires n 'Reverse and Add' steps to reach a palindrome.at n=26A066058