7063
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8080
- Proper Divisor Sum (Aliquot Sum)
- 1017
- 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
- 6048
- Möbius Function
- 1
- Radical
- 7063
- 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
- 101
- 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
- a(n) = floor(tau*a(n-2)) + a(n-1) with a(0)=1 and a(1)=3.at n=14A005907
- Number of strict 3rd-order maximal independent sets in path graph.at n=41A007384
- Numbers k such that Fib(k) == 13 (mod k).at n=35A023178
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 24.at n=6A031702
- The first n digits of the juxtaposition of the base-2 numbers converted to decimal.at n=12A055143
- a(n) = Sum_{d|n} d*prime(d).at n=38A061150
- Number of representations of n as a sum of products of positive integers. 1 is not allowed as a factor, unless it is the only factor. Representations which differ only in the order of terms or factors are considered equivalent.at n=25A066739
- Expansion of (1+x^2)*(1+x^5)*(1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)*(1-x^8)*(1-x^9)*(1-x^10)).at n=28A069950
- Take pairs (x,y) with Sum_{j = x..y} j = concatenation of x and y. Sort pairs on y then x. This sequence gives x of each pair.at n=30A070152
- Interprimes which are of the form s*prime, s=7.at n=6A075282
- Molien series for action of SL(3,C) on ternary forms of degree 4.at n=26A083024
- Start with 1 and repeatedly reverse the digits and add 62 to get the next term.at n=30A118157
- Integers of the form c(n)/b(n) where c(n+1)=c(n)+(n+1)^4 with c(0)=1 and b(n+1)=b(n)+(n+1)^2 with b(0)=1.at n=43A119617
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=6A120215
- a(n) = Fibonacci(n) mod n^3.at n=21A132636
- a(n) = 15*n^2 - 9*n + 1.at n=22A134154
- The Wiener index of a chain of n triangles (i.e., joined like VVV..VV; here V is a triangle!).at n=20A143941
- 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, 0), (0, 1, -1), (1, 0, 1)}.at n=9A148768
- a(n) = 49*n^2 + 7.at n=11A158481
- Numbers k such that 30*k and 60*k are both the average of twin prime pairs.at n=40A177679