17771
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 1381
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16392
- Möbius Function
- 1
- Radical
- 17771
- 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
- 71
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_69 of Monster module.at n=48A034457
- Denominators of continued fraction convergents to sqrt(139).at n=10A041255
- Numbers n such that h(n) = 2 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)at n=22A078419
- Palindromes whose product of digits is a positive palindrome.at n=44A082207
- a(n) = concatenate(n, A010888(2*n), reverse(n)), where A010888 = digital root.at n=16A082944
- Palindromic numbers with property that sum of digits is prime and number of prime digits is prime.at n=25A093807
- Palindromes n such that 10n01 is a prime.at n=29A099744
- Consider all (2n+1)-digit palindromic primes of the form 70...0M0...07 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M.at n=47A100956
- Consider all (2n+1)-digit palindromic primes of the form 90...0M0...09 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M.at n=50A100957
- Numbers k such that 11k = 6j^2 + 6j + 1.at n=32A106388
- a(n+2) = a(n+1)*(n mod 3 + 1) + (n mod 2 + 1), a(1) = 11.at n=12A136433
- a(n) = n 7's sandwiched between two 1's.at n=3A205087
- Number of n-bead necklaces labeled with numbers -4..4 allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=6A209481
- T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=51A209485
- Number of 7-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=3A209488
- Indices of records in A245203 (= least k>=0 such that 4n+3 is the mean of primes 4(n-k)+3 and 4(n+k)+3).at n=24A245205
- Palindromes with no palindromic aliquot parts except 1.at n=21A257973
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=24A273701
- Numbers using only digits 1 and 7.at n=44A276039
- Least number x such that x^n has n digits equal to k. Case k = 7.at n=20A285454