4068
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
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 10374
- Proper Divisor Sum (Aliquot Sum)
- 6306
- 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
- 1344
- Möbius Function
- 0
- Radical
- 678
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 157
- 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
- Number of compositions (ordered partitions) of n into squares.at n=26A006456
- Coordination sequence T3 for Zeolite Code LOV.at n=42A008136
- Coordination sequence T4 for Zeolite Code MTW.at n=42A008199
- Number of 1's in n-th term of A006711.at n=31A022477
- Coordination sequence T2 for Zeolite Code CGS.at n=47A027366
- Graham-Sloane-type lower bound on the size of a ternary (n,3,6) constant-weight code.at n=7A030506
- Numbers whose set of base-15 digits is {1,3}.at n=19A032922
- Every run of digits of n in base 5 has length 2.at n=26A033003
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.at n=19A049726
- e-perfect numbers: numbers k such that the sum of the e-divisors (exponential divisors) of k equals 2*k.at n=37A054979
- Number of 3-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 3 labeled nodes and n hyperedges.at n=9A056005
- Multiples of 9 having only even digits.at n=26A061831
- Smallest m such that C(2m,m) is divisible by (m+n)!/m!.at n=10A065352
- If n is squarefree then a(n) = Min{k | A070077(k) = n} else 0.at n=29A070078
- Number of unlabeled, connected graphs on n vertices that have no induced subgraph isomorphic to a bull, a P5 or a P5-bar.at n=8A079577
- Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n-2). r and s are positive integers.at n=27A085950
- Self-convolution of A004148 (the RNA secondary structure numbers) with itself.at n=11A089735
- Convolution of 5^n and floor(n/2).at n=7A097139
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths in which the k-th step is the leftmost (1,0)-step (can be easily expressed using RNA secondary structure terminology).at n=50A098086
- Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=15A108914