7103
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
- 7104
- 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
- 7102
- Möbius Function
- -1
- Radical
- 7103
- 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
- 150
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 910
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of geometric n-dimensional crystal classes.at n=6A004028
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 83.at n=21A031581
- Sums of 11 distinct powers of 2.at n=26A038462
- Numbers whose base-4 representation contains exactly two 2's and four 3's.at n=16A045147
- Primes with first digit 7.at n=27A045713
- 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=39A056068
- First member of a prime triple in a p^2 + p - 1 progression.at n=31A057324
- Primes p such that x^53 = 2 has no solution mod p.at n=16A059258
- Primes p such that x^67 = 2 has no solution mod p.at n=14A059330
- Number of partitions of n^2 into exactly n nonzero parts, such that there are at most one 1's, two 2's, ... n-1 n-1's, n n's, n-1 n+1's, ... two 2n-2's and one 2n-1.at n=7A062881
- a(n) is the least index such that the least primitive root of the a(n)-th prime is n, or zero if no such prime exists.at n=43A066529
- a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n-1) that differs from a(n-1) by a square.at n=29A073609
- a(n) = A085956(3n+1).at n=22A086362
- a(1)=11; for n>1, a(n) is the smallest prime not occurring earlier beginning with a(n-1) without its first digit. Single-digit primes are not allowed unless they arise from the previous term as multi-digit number with leading zero(s) (i.e., a(n-1) has 0 as second digit) which are remembered for the subsequent left-truncations.at n=56A089755
- Values of n such that len_x(n) = 0 in A090822.at n=12A091410
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=15A094933
- Primes with two 0-bits in their binary expansion.at n=43A095079
- Least positive integer that can be represented as sum of a semiprime and a square in exactly n ways.at n=47A101181
- Primes of the form 100*n + 3.at n=23A101780
- Primes p such that the largest prime factor of p^5 + 1 is less than p.at n=2A102327