4258
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6390
- Proper Divisor Sum (Aliquot Sum)
- 2132
- 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
- 2128
- Möbius Function
- 1
- Radical
- 4258
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 126
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T2 for Zeolite Code AEL.at n=43A008005
- Coordination sequence T2 for Zeolite Code RTH.at n=45A009894
- Coordination sequence T1 for Zeolite Code VET.at n=40A009902
- Expansion of 1/((1-2x)(1-5x)(1-7x)(1-9x)).at n=3A025993
- Sum of the numbers between the two n's in A026362.at n=34A026365
- 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 64.at n=12A031562
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 4).at n=42A035549
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=12A045055
- a(n) = 4*n^2 - 3*n + 1.at n=33A054552
- Numbers k such that k^128 + 1 is prime.at n=15A056994
- Number of 4 X n binary matrices without unit columns up to row and column permutations.at n=8A057223
- Sum of the digits of the n-th Mersenne prime (A000668).at n=17A066538
- Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.at n=52A080715
- Pascal-(1,2,1) array read by antidiagonals.at n=61A081577
- Pascal-(1,2,1) array read by antidiagonals.at n=59A081577
- Fourth row of Pascal-(1,2,1) array A081577.at n=6A081584
- Least integer m such that between m and 2m there are n triangular numbers.at n=38A085762
- Positive integers n such that n^11 + 1 is semiprime.at n=25A105122
- Semiprimes with prime sum of decimal digits and prime sum of prime factors.at n=38A108610
- Recurrence: a(n) = Sum_{k=0..n-1} C(2*n-1,n-k-1)*a(k) with a(0)=1.at n=6A110531