6013
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6880
- Proper Divisor Sum (Aliquot Sum)
- 867
- 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
- 5148
- Möbius Function
- 1
- Radical
- 6013
- 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
- 142
- 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
- no
- Odd
- yes
Appears in sequences
- cosh(log(x+1)-sinh(x))=1+3/4!*x^4-10/5!*x^5+100/6!*x^6-693/7!*x^7...at n=8A013267
- a(n) = a(n-1)+a(n-4).at n=26A014097
- Number of ways to partition n elements into pie slices of different sizes other than one.at n=35A032155
- Multiplicity of highest weight (or singular) vectors associated with character chi_11 of Monster module.at n=41A034399
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=6A045132
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, 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) = a(2) = 1 and a(3) = 3.at n=14A049893
- a(n+1)^2 is next smallest nontrivial square containing a(n)^2 as a substring, initial term is 1.at n=4A050629
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 16.at n=25A050965
- Column 4 of triangle A055907.at n=7A055910
- Numbers n such that digits of n and the prime factorization of n are distinct and nonrepeating.at n=28A057885
- Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.at n=29A090424
- Numerators of "Farey fraction" approximations to Pi.at n=43A097545
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 6 multiples of n-1, n-2, ..., 1.at n=46A113743
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 10 multiples of n-1, n-2, ..., 1, for n>=1.at n=35A113747
- Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions).at n=29A132410
- Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=3A152207
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows.at n=23A157211
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows.at n=25A157211
- The smallest magic constant of an n X n magic square with distinct prime entries.at n=10A164843
- Numbers n such that n^2 is a concatenation of two nonzero squares with no trailing zeros in n.at n=37A198035