17527
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18576
- Proper Divisor Sum (Aliquot Sum)
- 1049
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16480
- Möbius Function
- 1
- Radical
- 17527
- 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
- 48
- 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
- Generalized Lucas numbers.at n=15A006491
- Numbers whose base-4 representation has exactly 8 runs.at n=23A043599
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 8.at n=23A043850
- Numbers n such that number of runs in the base 4 representation of n is congruent to 8 mod 9.at n=23A043866
- Numbers k such that number of runs in the base 4 representation of k is congruent to 8 mod 10.at n=23A043875
- Least k such that 10^(2n-1)+k is a brilliant number.at n=40A084476
- a(n) = a(n-1) + s, where s is the least square >= a(n-1) and the first digit of s equals the first digit of a(n-1). a(0)=1.at n=9A175529
- Number of ways to reciprocally link elements of an nX6 array either to themselves or to exactly two horizontal or antidiagonal neighbors.at n=4A220630
- T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal or antidiagonal neighbors.at n=49A220632
- Number of ways to reciprocally link elements of an 5Xn array either to themselves or to exactly two horizontal or antidiagonal neighbors.at n=5A220635
- Number of ordered triples (i,j,k) with |i|, |j|, |k|, |i*j*k| <= n.at n=35A226359
- Values of n such that L(20) and N(20) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=41A227523
- Numbers which are palindromic in their Elias delta code representation.at n=38A281380
- Number of relatively prime or monic partitions of n.at n=35A300486
- Sum of the second largest parts of the partitions of n into 10 parts.at n=38A326597
- Number of length n strings on the alphabet {0,1,2,3} with digit sum at most 4.at n=23A363256
- Number of partitions of n such that the least part occurs exactly (1/3)*(number of parts) times.at n=53A386360