6014
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9408
- Proper Divisor Sum (Aliquot Sum)
- 3394
- 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
- 2880
- Möbius Function
- -1
- Radical
- 6014
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of words of length n in a certain language.at n=37A005819
- Number of rooted trees where any 2 subtrees extending from the same node have a different number of nodes.at n=14A032305
- Numbers having three 2's in base 9.at n=31A043463
- Numbers k such that k^2 is composed of three 1-digit-overlapping subsquares.at n=5A048426
- Number of rooted trees with n nodes with every leaf at height 8.at n=17A048813
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=28A055468
- Least k such that k*10^n-9, k*10^n-7, k*10^n-3 and k*10^n-1 are all prime.at n=16A064432
- a(1)=1, a(2)=2, a(n+2)=(a(n+1)+a(n))/2 if a(n+1)+a(n) is even, a(n+2)=(3*(a(n+1)+a(n))+1)/2 otherwise.at n=22A069162
- Total number of smallest parts in all partitions of n into odd parts.at n=37A092268
- Numbers n such that p(2n) is prime, where p(n) is the number of partitions of n.at n=43A114165
- 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=43A114315
- Number of partitions of n having exactly 1 part that appears exactly once.at n=39A116596
- Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=15A129245
- Indices of record values in A046641.at n=39A145772
- a(n) = 100*n^2 - 49*n + 6.at n=7A157651
- Collatz (or 3x+1) trajectory starting at 703.at n=15A161021
- Number of ways are there to score a break of n points at snooker. Assuming an infinite number of reds are available, along with the usual six colors, and a break alternates red-color-red-...at n=27A180158
- Number of parts of the n-th subshell of the head of the last section of the set of partitions of any odd integer >= 2n+1.at n=16A182993
- G.f.: (1+x^4)/(1-x-x^8).at n=44A193942
- 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=29A217297