6092
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10668
- Proper Divisor Sum (Aliquot Sum)
- 4576
- 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
- 3044
- Möbius Function
- 0
- Radical
- 3046
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 36
- 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 nonseparable toroidal tree-rooted maps with n + 3 edges and n + 1 vertices.at n=3A006415
- 7th-order maximal independent sets in cycle graph.at n=57A007389
- a(n) = floor(n*(n-1)*(n-2)/9).at n=39A011891
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=10A025513
- Number of achiral polyominoes with n cells.at n=16A030227
- Numbers k such that 207*2^k + 1 is prime.at n=38A032480
- Numbers k such that 235*2^k+1 is prime.at n=25A032494
- Number of partitions of n into parts not of the form 19k, 19k+9 or 19k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=32A035978
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=28A045940
- a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.at n=38A049628
- Sums of terms of groups in A075621.at n=22A075625
- a(n) = floor(C(n+6,6)/C(n+2,2)).at n=34A084626
- Shadow of N (natural numbers), also of Champernowne's shadow.at n=41A110623
- Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n.at n=35A111389
- a(1)=2; a(n)=floor((13+sum(a(1) to a(n-1)))/6).at n=53A120179
- Numbers n such that n, n+1, n+2 and n+3 are products of exactly 3 primes.at n=27A124057
- Least k such that k*p(n)!/p(n)# -1 and k*p(n)!/p(n)# +1 are twin primes starting with n=3,(p(i)=i-th prime).at n=30A124086
- Number of nX5 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=3A207439
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=31A207442
- Number of 4Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207444