4293
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 6534
- Proper Divisor Sum (Aliquot Sum)
- 2241
- 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
- 2808
- Möbius Function
- 0
- Radical
- 159
- Omega Function (Ω)
- 5
- 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
- 25
- 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 points of norm <= n^2 in square lattice.at n=37A000328
- Eulerian numbers (Euler's triangle: column k=3 of A008292, column k=2 of A173018).at n=5A000460
- Eulerian numbers (Euler's triangle: column k=6 of A008292, column k=5 of A173018).at n=2A000514
- Expansion of a modular function for gamma_0(6).at n=17A006708
- Coordination sequence T1 for Zeolite Code ATT.at n=47A008041
- Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows.at n=33A008292
- Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows.at n=30A008292
- Numbers in the triangle of Eulerian numbers (A008292) that are not 1.at n=19A014449
- Numbers in the triangle of Eulerian numbers (A008292) that are not 1.at n=16A014449
- Odd numbers in the triangle of Eulerian numbers.at n=21A014459
- Odd numbers in the triangle of Eulerian numbers.at n=24A014459
- Odd numbers in the triangle of Eulerian numbers that are not 1.at n=7A014461
- Odd numbers in the triangle of Eulerian numbers that are not 1.at n=10A014461
- Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers.at n=13A014467
- Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.at n=7A014468
- Triangular array formed from odd elements to right of middle of rows of the triangle of Eulerian numbers (A008292).at n=10A014469
- Triangular array formed from odd elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.at n=4A014470
- Distinct elements occurring in triangle of Eulerian numbers (unsorted).at n=11A014630
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=18A024460
- Number of (s(0), s(1), ..., s(n)) such that s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 3; also a(n) = T(n,n-3), where T is the array defined in A026082.at n=7A026086