6003
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9360
- Proper Divisor Sum (Aliquot Sum)
- 3357
- 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
- 3696
- Möbius Function
- 0
- Radical
- 2001
- Omega Function (Ω)
- 4
- 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
- 41
- 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
- no
- Odd
- yes
Appears in sequences
- Related to Gilbreath conjecture.at n=27A001549
- Number of planted planar trees (n+1 nodes) where any 2 subtrees extending from the same node are different.at n=11A032027
- a(1) = 2; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=41A033679
- Number of partitions in parts not of the form 13k, 13k+1 or 13k-1. Also number of partitions with no part of size 1 and differences between parts at distance 5 are greater than 1.at n=41A035949
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=31A039867
- a(n) = (1/24)*n*(n + 5)*(n^2 + n + 6).at n=17A051743
- Number of nonprimes <= prime(n)^2.at n=22A053683
- Sum of terms in n-th group in A075352.at n=36A075356
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=20A081378
- a(n) = n*(2*n^2 + n + 1)/2.at n=17A085786
- A111386(n-1) concatenated with A111386(n+1) divided by A111386(n).at n=7A111387
- A111386(n-1) concatenated with A111386(n+1) divided by A111386(n).at n=9A111387
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 9.at n=39A136850
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 6 and 9.at n=15A136894
- Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 9.at n=18A136932
- Numbers k such that k and k^2 use only the digits 0, 3, 5, 6 and 9.at n=15A136939
- Numbers k such that k and k^2 use only the digits 0, 3, 6, 7 and 9.at n=15A136944
- Numbers k such that k and k^2 use only the digits 0, 3, 6, 8 and 9.at n=19A136945
- Numbers k such that k and k^2 use only the digits 0, 3, 6 and 9.at n=15A136946
- Number of binary strings of length n with no substrings equal to 0001 0010 or 0101.at n=12A164446