6044
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 4540
- 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
- 3020
- Möbius Function
- 0
- Radical
- 3022
- Omega Function (Ω)
- 3
- 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
- 93
- 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 nonequivalent dissections of an n-gon into n-4 polygons by nonintersecting diagonals up to rotation and reflection.at n=7A003450
- n is equal to the number of 1's in all numbers <= n written in base 7.at n=2A014887
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=14A020407
- [ exp(2/11)*n! ].at n=6A030946
- a(n) = S3(n,2), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.at n=3A089670
- Self-describing sequence. See the sequence as a succession of digits: then a(n) is the position of a prime digit in the sequence.at n=47A114315
- Number of unit square lattice cells enclosed by origin centered circle of diameter 2n+1.at n=44A136486
- Nonprimes formed by concatenation of the decimal digits of a nonprime and its index.at n=36A154507
- Number of binary strings of length n with equal numbers of 00010 and 00100 substrings.at n=13A164211
- a(n) = 4*n^2 - n - 1.at n=39A185950
- Triprimes (numbers that are a product of exactly three primes: A014612) that become cubes when their central digit or central pair of digits is deleted.at n=31A217297
- Number of partitions of n in which any two parts differ by at most 8.at n=34A218510
- Triangle T(n, k) = Number of non-equivalent (mod D_4) ways to arrange k indistinguishable points on an n X n square grid so that no three of them are collinear. Triangle read by rows.at n=33A235453
- Number of non-equivalent (mod D_4) ways to arrange 4 points on an n X n square grid so that no three points are collinear.at n=4A235455
- Number of ON cells at generation n of 2-D cellular automaton in which a cell is ON iff either 1 or 2 of its eight neighbors were ON at previous generation, starting with a single ON cell.at n=62A246311
- Numbers n such that A062234(n) = A062234(n+1) = A062234(n+2).at n=26A258449
- Number of (n+2)X(n+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001011.at n=3A260276
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001011.at n=3A260280
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001011.at n=24A260284
- Numbers such that antisigma(n) mod sigma(n) = d(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and d(n) is the number of divisors of n.at n=41A272337