4248
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
- 24
- Divisor Sum
- 11700
- Proper Divisor Sum (Aliquot Sum)
- 7452
- 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
- 1392
- Möbius Function
- 0
- Radical
- 354
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 126
- 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(n) = n! * (1 + 2*Sum_{k=1..n} 1/k).at n=6A000776
- Number of hexagonal n-element polyominoes whose graph is a path.at n=10A003104
- a(n) = round(1000*log_2(n)).at n=18A004266
- a(n) = ceiling(1000*log_2(n)).at n=18A004267
- a(n) = prime(n) + Fibonacci(n).at n=18A004397
- Coordination sequence T3 for Zeolite Code ATS.at n=47A008040
- Coordination sequence T6 for Zeolite Code DDR.at n=41A008076
- a(n) = number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2n) = 8. Also a(n) = T(2n,n-3), where T is the array defined in A026009.at n=5A026015
- a(n) = Sum_{k=0..2n} (k+1) * A027023(n,2n-k).at n=7A027044
- Theta series of 8-d 6-modular lattice G_2 tensor F_4 (or A_2 tensor D_4) with det 1296 and minimal norm 4 in powers of q^2.at n=8A028977
- a(n) = n*(n + ceiling(2^n/12)).at n=12A029929
- 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 15.at n=32A031513
- Concatenation of n and n + 6 or {n,n+6}.at n=41A032611
- Numbers k such that k(k+1)(k+2)...(k+9) / (k+(k+1)+(k+2)+...+(k+9)) is an integer.at n=31A032782
- Number of partitions of n with equal nonzero number of parts congruent to each of 2, 3 and 4 (mod 5).at n=49A035591
- Number of partitions of n into parts not of the form 17k, 17k+2 or 17k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 7 are greater than 1.at n=34A035963
- Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1.at n=37A035989
- Denominators of continued fraction convergents to sqrt(601).at n=8A042153
- a(n)=T(2n,n+1), where T is given by A048113.at n=8A048120
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2) = k; sequence gives values of k.at n=28A048191