17162
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 25746
- Proper Divisor Sum (Aliquot Sum)
- 8584
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8580
- Möbius Function
- 1
- Radical
- 17162
- 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
- 79
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers whose base-7 representation has exactly 6 runs.at n=4A043621
- a(n) = prime(n)^2 + 1.at n=31A066872
- Theorems from propositional calculus, translated into decimal digits.at n=26A101273
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=45A116721
- a(1) = 2. a(n) = a(n-1)*(largest prime occurring earlier in the sequence) + 1.at n=4A120762
- a(n) = 81*n^2 - 72*n + 17.at n=15A154277
- Numbers of the form q-p, where p and q are prime and q = p^0+p^1+p^2+..+p^k for some k.at n=15A166388
- Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639).at n=30A242489
- Smallest even k such that lpf(k-3) > lpf(k-1) >= prime(n), where lpf=least prime factor (A020639).at n=30A242719
- The smallest numbers of every class in a classification of positive numbers (see comment).at n=33A247395
- Numbers n such that 4n + 1, 4n + 2 and 4n + 3 are not squarefree.at n=41A258332
- Numbers that are both 1 + square of a prime and twice a prime.at n=10A259979
- Numbers m such that sigma(m-1) is a prime.at n=16A270413
- Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n.at n=21A271311
- Let s(n,j) be Sum_{i=1..j} (prime(primepi(n) + i) mod n). Numbers n such that there exists j with s(n,j) = n.at n=37A274423
- Number of integer partitions of n with exactly as many ones as the next greatest multiplicity.at n=50A382303