7003
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
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 197
- 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
- 6808
- Möbius Function
- 1
- Radical
- 7003
- 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
- 150
- 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
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10).at n=28A017823
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=27A024480
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=26A025100
- Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.at n=21A063670
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=39A064906
- Decimal representation of palindromes extracted from the Golden String using ever increasing Fibonacci-style subdivisions.at n=6A065353
- Number of simple graphs g on n nodes with |Aut(g)| = 8.at n=8A075098
- Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n} for n >= 0, B_0=0, B_1=1 and for n >= 2, B_n = 2B_{n-1}+(-1)^{A_n}. Sequence gives B_n.at n=13A080241
- a(n) = x is the smallest number such that gcd(prime(x)+1, x) = n.at n=46A084314
- Number of multi-trace BPS operators for the quiver gauge theory of the orbifold C^2/Z_2.at n=9A120844
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=9A148377
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150423
- Inverse permutation to A190130.at n=22A190131
- Expansion of (1+x)/(1-x^2-3*x^5).at n=27A238391
- Least k such that k^(6^n)*(k^(6^n) - 1) + 1 is prime.at n=5A246121
- Composites whose prime factorization in base 4 is an anagram of the number in base 4.at n=20A260048
- a(0) = 1; for n>0, working in binary, write n followed by 1 then n-reversed (including leading zeros); show result in base 10.at n=54A264619
- G.f.: 1/((1-t^11)^2*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^13)*(1-t^15)*(1-t^17)*(1-t^19)*(1-t^21)).at n=55A266751
- In the binary race of Pi, where the race leader changes.at n=25A278920
- a(n) = a(n-1) + sum of base-1000 digits of a(n-1), a(0)=1.at n=24A292568