4968
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
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 9432
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1584
- Möbius Function
- 0
- Radical
- 138
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 90
- 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
- Powers of fourth root of 6 rounded down.at n=19A018060
- Powers of fourth root of 6 rounded to nearest integer.at n=19A018061
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=24A024980
- Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 22 (most significant digit on right).at n=26A029515
- Numbers k such that 115*2^k+1 is prime.at n=12A032407
- Expansion of (1 - x)/(1 - 2*x - 2*x^2 + 2*x^3).at n=10A052528
- Number of stars brighter than visual magnitude n-1.at n=7A053406
- Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=28A054573
- Number of primitive (period n) periodic palindromes using exactly four different symbols.at n=11A056500
- a(n) = (Product k) * (Sum 1/k), where both the product and the sum are over those positive integers k, where k <= n and gcd(k,n) = 1.at n=8A056855
- Triangle of numbers T(n,k) = T(n-1,k-1) + ((n+k-1)/k)*T(n-1,k), n >= 1, 1 <= k <= n, with T(n,1) = n!, T(n,n) = 1; read from right to left.at n=33A059369
- a(n) = 18*(n - 2)*(2*n - 5).at n=12A060787
- a(n) = prime(n)^2 - prime(n+1).at n=19A062235
- Smallest number m such that m and the product of digits of m are both divisible by 8n, or 0 if no such number exists.at n=26A073912
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.at n=45A075606
- Triangle T(n, k) read by rows. T(n, k) is the number of lists of k unlabeled permutations whose total length is n.at n=39A090238
- Number of Pythagorean quadruples mod n; i.e., number of solutions to w^2 + x^2 + y^2 = z^2 mod n.at n=17A096018
- Triangle T, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) for n>k+1>=1, with T(n,n) = 1 and T(n+1,n) = n+1 for n>=0, where T^2 is the matrix square of T.at n=48A109152
- Numbers with at least two 3s in their prime signature.at n=11A109399
- Triangle T(n,k) = Sum_{i=0..k} (-1)^(i+k)*binomial(k,i)*Sum_{j=0..n} (i+1)^j*(3n-3j+1) read by rows.at n=25A116923