7102
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
- 8
- Divisor Sum
- 11016
- Proper Divisor Sum (Aliquot Sum)
- 3914
- 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
- 3432
- Möbius Function
- -1
- Radical
- 7102
- 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
- 88
- 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
- yes
- Odd
- no
Appears in sequences
- a(n)=(s(n)+3)/10, where s(n)=n-th base 10 palindrome that starts with 7.at n=32A043086
- Numbers whose base-4 representation contains exactly three 2's and three 3's.at n=26A045151
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=38A056068
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=42A056219
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=22A060879
- For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k.at n=23A065978
- a(n) is the smallest composite k such that Sum_{composites j = 4, ..., k} 1/j exceeds n.at n=5A076751
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.at n=13A089419
- Numbers k such that the first 9 decimal digits of the k-th Fibonacci number is 1-9 pandigital.at n=2A112516
- Binomial transform of [1, 1, 7, 7, 7, ...].at n=10A131068
- Numbers such that the digital sum base 2 and the digital sum base 5 and the digital sum base 10 all are equal.at n=5A135125
- a(n) = prime(prime(prime(A028815(n) - 1) - 1) - 1) - 1.at n=12A141133
- a(n) = prime(prime(prime(n) - 1) - 1) - 1, where prime(n) = n-th prime.at n=36A141208
- a(n) = number of distinct prime divisors (taken together) of numbers of the form x^2+1 for x<=10^n.at n=3A144848
- 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), (0, 0, -1), (0, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=7A150672
- Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=5A152207
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=8A157116
- a(n) = 10*n^2 - 7*n + 1.at n=27A158186
- Number of permutations of 1..n containing the relative rank sequence { 41532 } at any spacing.at n=3A158427
- Number of lines through at least 2 points of a 4 X n grid of points.at n=44A160844