3013
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3168
- Proper Divisor Sum (Aliquot Sum)
- 155
- 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
- 2860
- Möbius Function
- 1
- Radical
- 3013
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 22
- 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
- Primes written in base 4.at n=45A004678
- Number of weighted voting procedures.at n=9A005254
- Numerators in a worst case of a Jacobi symbol algorithm.at n=6A005825
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=36A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=36A007707
- Coordination sequence T3 for Zeolite Code EMT.at n=45A008088
- Coordination sequence T3 for Zeolite Code LTN.at n=38A008142
- Coordination sequence for Paracelsian.at n=37A008260
- From George Gilbert's marks problem: jumping 6 marks at a time (final positions).at n=9A019996
- Numbers k such that the continued fraction for sqrt(k) has period 58.at n=10A020397
- a(n) = floor(floor(S3)/floor(S1)), where S3 and S1 are, respectively, the 3rd and first elementary symmetric functions of {sqrt(k), k = 1,2,...,n}.at n=32A025200
- a(n) = Sum_{k=0..n} T(n,k) * T(n,n+k), with T given by A027082.at n=6A027109
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 18 (most significant digit on left).at n=7A029487
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 28 ones.at n=15A031796
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 3).at n=40A035534
- Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 3,0,1.at n=3A037652
- Numbers n such that string 1,3 occurs in the base 10 representation of n but not of n-1.at n=33A044345
- Numbers n such that string 1,3 occurs in the base 10 representation of n but not of n+1.at n=33A044726
- a(n) = T(n+1,n), array T given by A048201.at n=49A048204
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=27A050967