6030
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
- 24
- Divisor Sum
- 15912
- Proper Divisor Sum (Aliquot Sum)
- 9882
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1584
- Möbius Function
- 0
- Radical
- 2010
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 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 protruded partitions of n with largest part at most 3.at n=14A005404
- Length of n-th term of A022482.at n=28A022483
- "EFK" (unordered, size, unlabeled) transform of 2,1,1,1,...at n=51A032303
- Every run of digits of n in base 14 has length 2.at n=35A033012
- Differences of A038011.at n=20A038012
- Positive integers having more base-14 runs of even length than odd.at n=37A044840
- a(n) = T(2n-1,n), array T given by A048225.at n=41A048234
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=39A050069
- Number of step cyclic shifted sequences using exactly six different symbols.at n=7A056419
- Number of primitive (period n) step cyclic shifted sequences using exactly six different symbols.at n=7A056428
- Number of primitive (period n) periodic palindromes using a maximum of two different symbols.at n=23A056493
- Number of primitive (period n) periodic palindromes using exactly two different symbols.at n=23A056498
- Eighth column of quintinomial coefficients.at n=7A064057
- Numbers n such that n#*2^n+1 is prime, where n# = product of primes <= n.at n=47A084404
- a(n) = C(2n-1,n-1) mod n^3.at n=23A099907
- a(n) = (p^2 - 1) / 12, where p is the n-th prime of the form 4*k+1.at n=25A109255
- Record gaps between twin primes.at n=33A113274
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=24A113537
- Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts.at n=32A117455
- Numbers k such that 22*3^k + 1 is prime.at n=32A120491