4911
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6552
- Proper Divisor Sum (Aliquot Sum)
- 1641
- 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
- 3272
- Möbius Function
- 1
- Radical
- 4911
- 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
- 121
- 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
- The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=33A005576
- a(n) = floor( n*(n-1)*(n-2)/27 ).at n=52A011909
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=22A020393
- a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3.at n=28A022866
- a(n) = position of n^2 + (n+1)^2 + (n+2)^2 in A004432.at n=43A024809
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 23.at n=23A031521
- Numbers k such that 81*2^k+1 is prime.at n=44A032390
- Number of partitions in parts not of the form 21k, 21k+1 or 21k-1. Also number of partitions with no part of size 1 and differences between parts at distance 9 are greater than 1.at n=38A035979
- Numbers having three 6's in base 9.at n=17A043479
- Number of Baxter permutations: A001183/2.at n=7A046997
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.at n=26A054222
- a(0)=1, a(n) is the smallest integer >= a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals the number of elements in this continued fraction.at n=43A070900
- Greatest squarefree number not exceeding n-th prime power which is not prime.at n=42A081218
- a(n) = (2^n + 1)^3 - 2.at n=4A099359
- Numbers n such that (n + prime(n)), (n+1 + prime(n+1)) and (n+2 + prime(n+2)) are divisible by 5.at n=27A107581
- Numbers k that divide the sum of the digits of (k!)^2.at n=18A108862
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 7 and 9.at n=13A136998
- G.f. satisfies: A(x) = x/(1 - A(x+x^2)).at n=7A140046
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 101-111-100 pattern in any orientation.at n=9A146191
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 101-111-100 pattern in any orientation.at n=20A146193