6002
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9006
- Proper Divisor Sum (Aliquot Sum)
- 3004
- 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
- 3000
- Möbius Function
- 1
- Radical
- 6002
- Omega Function (Ω)
- 2
- 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
- 41
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Related to Gilbreath conjecture.at n=26A001549
- a(n) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=32A002125
- Symmetries in planted (1,3) trees on 2n vertices.at n=10A003609
- a(n) = n + max_{0 <= i <n} ((n-i)*a(i)), a(0) = 1.at n=20A008609
- Coordination sequence for Cr3Si, Si position.at n=20A009927
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=20A010005
- Self-convolution of array T given by A026637.at n=7A026966
- Number of decimal digits in n-th Mersenne prime.at n=23A028335
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(1,5) <= cn(3,5) = cn(4,5).at n=67A036856
- Maximal base 7 run length is 4.at n=26A037991
- Numbers whose base-7 representation contains exactly four 3's.at n=2A043408
- Unitary untouchable numbers: us(x) = n has no solution where us(x) (A063919) is the sum of the proper unitary divisors of x.at n=40A063948
- a(n) is the smallest number k such that A073813(k) = prime(n).at n=22A073814
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=24A105233
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).at n=29A110107
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=16A116037
- a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=22A120389
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 6.at n=13A136883
- Number of digits in n-th even superperfect number A061652(n).at n=23A138883
- a(n) = A138906(n) - A138905(n).at n=49A138907