4265
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5124
- Proper Divisor Sum (Aliquot Sum)
- 859
- 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
- 3408
- Möbius Function
- 1
- Radical
- 4265
- 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
- 170
- 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
- Coordination sequence T3 for Zeolite Code MEL.at n=42A008152
- Number of ways of embedding a connected graph with n edges in the square lattice.at n=7A019988
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=20A020370
- Fibonacci sequence beginning 1, 29.at n=12A022399
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A001950 (upper Wythoff sequence).at n=18A024465
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+7 or 16k-7.at n=45A036023
- Sum of first n lucky numbers.at n=42A046279
- Starting positions of strings of 2 3's in the decimal expansion of Pi.at n=31A050222
- Handsome numbers (A007532) representable as a sum of any positive powers of their digits in two distinct ways, not counting different powers of duplicated digits as distinct.at n=36A050240
- Composite and every divisor (except 1) contains the digit 5.at n=35A062672
- Numbers n such that n and n+1 both are members of A074997; i.e., on the one hand n-1 and n+1 have the same prime signature, on the other hand n and n+2 have the same prime signature.at n=27A086540
- Numbers n such that n together with its double and triple contain every digit.at n=31A120564
- Integers of the form (p(n+1)*p(n) - 1)/(p(n+1) - p(n)) where p(n) denotes the n-th prime.at n=35A128490
- Row sums of triangle A134237.at n=41A134238
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 3X2 zee 1,1 1,2 1,3 2,3 2,4 in any orientation.at n=11A146133
- The PolyLog functional part of A008292 (the Eulerian numbers) is treated as a curvature to give a set of polynomial triangle sequence coefficients: p(x,n)=Sum[A008292(n,m)*x^(m-1),{m,0,n}]; q(x,n)=k from Solve[FullSimplify[ExpandAll[p[x, n]/(x - 1)^n]] - (1 + k/x^2) == 0, k].at n=37A146540
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 11000-01100-00110-00011 pattern in any orientation.at n=15A147450
- Numbers k such that k-+1 are divisible by exactly 5 primes, counted with multiplicity.at n=33A157485
- Numbers m such that all numbers 10*m+(odd single-digit number) and 100*m+(any 2-digit, digits coprime to 10) are composite.at n=29A163398
- Numbers n such that n'' = n'+1 where n' and n'' are respectively the first and the second arithmetic derivative of n (A003415).at n=4A189639