17171
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21504
- Proper Divisor Sum (Aliquot Sum)
- 4333
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13320
- Möbius Function
- -1
- Radical
- 17171
- 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
- 172
- 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
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5)).at n=49A036804
- Numbers whose base-7 representation has exactly 6 runs.at n=12A043621
- Numbers that are palindromic, divisible by 11 and have an odd number of digits.at n=14A045571
- Composite palindromes whose sum of prime factors is prime (counted with multiplicity).at n=40A046365
- Numbers whose consecutive digits differ by 6.at n=31A048408
- Partial sums of A051865.at n=21A050441
- Numbers n such that n and 2n+1 are both palindromes.at n=39A069881
- Palindromes with successive increasing difference: a(k)-a(k-1) > a(k+1)- a(k).at n=38A071250
- Partition the nonnegative integers into minimal groups whose sums are palindromes; this sequence gives the sums.at n=23A072482
- Palindromic odd composite numbers that are the products of an odd number of distinct primes.at n=36A075808
- Smallest palindrome beginning with n and digit sum n, or 0 if no such number exists.at n=16A082217
- Smallest palindrome beginning with n and a digit sum of n at some stage.at n=16A082935
- Palindromes divisible by each of their digits.at n=52A082937
- Palindromes with more than 3 digits in which the absolute difference of a pair of successive digits is identical.at n=20A085109
- a(1) = 2; then smallest palindrome > 1 not occurring earlier such that every partial concatenation is a prime.at n=42A088086
- Palindromic numbers with property that sum of digits is prime and number of prime digits is prime.at n=23A093807
- Palindromes n such that 10n01 is a prime.at n=28A099744
- 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=40A100957
- Palindromic numbers that contain the sum of their digits as a substring.at n=20A121939
- Numbers k such that k^2+1 = 2p,(k+1)^2+1 = 5q, (k+2)^2+1 = 10r where p, q, and r are primes.at n=23A181619