7163
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8400
- Proper Divisor Sum (Aliquot Sum)
- 1237
- 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
- 7163
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- Composite Number
- yes
- Semiprime
- no
- 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) = n*(17*n + 1)/2.at n=29A022275
- Fibonacci sequence beginning 0, 19.at n=14A022353
- a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0).at n=45A026039
- Sums of 11 distinct powers of 2.at n=30A038462
- Numbers whose base-4 representation contains exactly two 2's and four 3's.at n=18A045147
- a(n) = least composite number such that sigma(a(n)+n!) = sigma(a(n))+n! where sigma() = A000203.at n=7A054982
- The a(n)-th composite number is 2^n.at n=11A065891
- Duplicate of A065891.at n=11A073801
- a(1) = 7 then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=23A083994
- Numbers which are the sum of two positive cubes and divisible by 13.at n=32A094447
- Numbers k such that 7*R_k - 6 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A099419
- Numbers which are the sum of two positive cubes and divisible by 19.at n=23A102619
- Number of ordered triples (i,j,k) in range [0..n] satisfying i == j mod 2 and j == k mod 3.at n=34A115520
- a(n) = 6 + floor( Sum_{j=1..n-1} a(j)/4 ).at n=32A120164
- 3-almost primes that are the sum of 2 positive cubes. Sums of 2 positive cubes, with the sums having exactly 3 prime divisors counted with multiplicity.at n=26A122732
- Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are intersecting but for which x is not a subset of y and y is not a subset of x, or 1) x and y are intersecting and for which either x is a proper subset of y or y is a proper subset of x, or 2) x = y.at n=7A134064
- Expansion of (1 - x + 5x^2)/((1-x)*(1-2x)).at n=11A154118
- a(n) is the smallest positive multiple of 2n-1 that contains the binary representation of n in its binary representation and that is a palindrome when written in binary.at n=14A158789
- Products of 3 distinct primes whose binary expansion is palindromic.at n=33A168355
- Numbers n such that A193232(n) is a triangular number.at n=9A220518