4797
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 7644
- Proper Divisor Sum (Aliquot Sum)
- 2847
- 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
- 2880
- Möbius Function
- 0
- Radical
- 1599
- Omega Function (Ω)
- 4
- 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
- 72
- 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
- no
- Odd
- yes
Appears in sequences
- Number of modes of connections of 2n points.at n=7A006605
- Number of 5-leaf rooted trees with n levels.at n=11A007715
- Coordination sequence T1 for Zeolite Code MFI.at n=44A008161
- Pseudoprimes to base 73.at n=46A020201
- a(n) = position of n^2 + (n+1)^2 + (n+2)^2 in A000408.at n=42A024802
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=22A024848
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (composite numbers).at n=31A024860
- a(n) = T(n, n-2), where T is given by A026519. Also number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 2.at n=10A026522
- a(n) = T(n,n-2), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 2.at n=10A026539
- a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A026519.at n=4A027264
- a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A026536.at n=5A027269
- a(n) = Sum_{k=0..m-2} T(n,k) * T(n,k+2), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.at n=4A027317
- a(n)^2 has last digit equal to the sum of the other digits.at n=15A030134
- Partial sums of primes congruent to 5 mod 6.at n=32A038361
- Numerators of continued fraction convergents to sqrt(599).at n=5A042148
- Cubic star numbers: a(n) = n^3 + 4*Sum_{i=0..n-1} i^2.at n=13A051673
- T(n,n-6), where T is the array in A055830.at n=8A055833
- a(n) = 3*n^2 + 6*n.at n=39A067725
- Prefixing, suffixing or inserting a 7 in the number anywhere gives a prime.at n=34A069832
- Numbers k that divide 2^(k+3) - 1.at n=28A069927