7013
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
- 2
- Divisor Sum
- 7014
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 7012
- Möbius Function
- -1
- Radical
- 7013
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 57
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 902
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 6 positive 6th powers.at n=46A003362
- Reduced interval graphs with n nodes.at n=10A005977
- Expansion of e.g.f.: log(1+sinh(tan(x))).at n=7A009348
- Numbers k such that the continued fraction for sqrt(k) has period 9.at n=38A010339
- arcsin(tan(tan(x)))=x+5/3!*x^3+121/5!*x^5+7013/7!*x^7+760465/9!*x^9...at n=3A012151
- Place where n-th 1 occurs in A023125.at n=43A022787
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 4.at n=45A023253
- Primes that remain prime through 3 iterations of function f(x) = 5x + 4.at n=16A023284
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence).at n=35A024863
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 9.at n=15A031422
- Odd k for which k+2^m is composite for all m < k.at n=5A033919
- Primes with first digit 7.at n=19A045713
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.at n=33A049725
- Numbers n such that 291*2^n-1 is prime.at n=23A050904
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 11.at n=19A050960
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=27A051401
- Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.at n=27A051402
- Least prime in A031924 (lesser of 6-twins) such that the distance to the next 6-twin is 2*n.at n=42A052352
- Primes p such that p^6 reversed is also prime.at n=34A059699
- An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.at n=28A060434