4916
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8610
- Proper Divisor Sum (Aliquot Sum)
- 3694
- 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
- 2456
- Möbius Function
- 0
- Radical
- 2458
- Omega Function (Ω)
- 3
- 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
- 41
- 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
- a(0)=1, a(n) = 3*a(n-1) + n + 1.at n=7A000340
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.at n=26A008971
- Coordination sequence T1 for Keatite.at n=39A009844
- Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of universal W-group W(4).at n=7A014697
- Powers of fourth root of 22 rounded down.at n=11A018108
- a(n) = T(2n-1,n), where T is the array in A026323.at n=5A026331
- Numbers whose base-7 representation contains exactly four 2's.at n=2A043404
- Numbers having three 6's in base 9.at n=20A043479
- Numbers whose base-3 representation contains exactly four 0's and no 1's.at n=34A044985
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=13A045013
- Nonnegative numbers of the form n^3 (+/-) 3, n >= 0.at n=33A052276
- x = a(n) is the smallest composite number such that sigma(x+6n) = sigma(x)+6n, where sigma = A000203.at n=36A054904
- 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 2n.at n=37A070898
- Numbers m = d_1 d_2 ... d_k (in base 10) with properties that k is even and d_i + d_{k+1-i} = 10 for all i.at n=44A083678
- a(n) = n^3 + 3.at n=17A084378
- Number of permutations of decimal digits of 2^n which yield a prime.at n=26A086151
- Number of partitions of 2*n into distinct parts with exactly two odd parts.at n=28A096914
- Expansion of (1-x^2)/((1-2*x)*(1+x^2)).at n=13A100088
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 13 for n > 0.at n=16A101067
- Triangle T(n,k), 0 <= k <= n, read by rows: given by [ 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, ...] DELTA [ 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, ...] where DELTA is the operator defined in A084938.at n=46A102365