3948
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 6804
- 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
- 1104
- Möbius Function
- 0
- Radical
- 1974
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 38
- 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
- Coordination sequence for 4-dimensional I-centered tetragonal orthogonal lattice.at n=9A001386
- Expansion of 1 / Sum_{n=-oo..oo} x^(n^2).at n=18A004402
- Expansion of 1 / Product_{k>=1} (1-x^k)^(k+1).at n=11A005380
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=33A007333
- Coordination sequence T5 for Zeolite Code GOO.at n=43A008115
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=49A011910
- Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.at n=18A015128
- Fibonacci sequence beginning 0, 4.at n=16A022087
- Sum of digits in n-th term of A022470.at n=26A022475
- a(n) is the position of square of n-th prime among the powers of primes (A000961).at n=42A024624
- Numbers having period-1 5-digitized sequences.at n=40A031187
- Concatenation of n and n + 9 or {n,n+9}.at n=38A032614
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=30A039893
- Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=3.at n=8A050211
- a(n) = T(n,n-4), array T as in A055807.at n=24A055809
- Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n.at n=50A065984
- Number of basis partitions (or basic partitions) of n.at n=42A066447
- n - 5^k is a prime for all k > 0 and n > 5^k.at n=48A067529
- a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.at n=19A067817
- Total number of prime power parts in all partitions of n.at n=21A073335