17274
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 17286
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5756
- Möbius Function
- -1
- Radical
- 17274
- 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
- 128
- 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
- yes
- Odd
- no
Appears in sequences
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=38A049355
- Numbers which are the sum of their proper divisors containing the digit 7.at n=23A059466
- Numbers which are the sum of their proper divisors containing the digit 8.at n=11A059467
- Antidiagonal sums of A086272 (and of A086273).at n=23A086274
- A127790(n)/2.at n=15A127811
- 1/4 the number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=17A189953
- Number of n-step two-sided prudent self-avoiding walks.at n=10A191605
- a(n) = 2*a(n-1) + a(n-3) for n >= 4, with initial values a(0) = 1, a(1) = 0, a(2) = 2, and a(3) = 3.at n=14A335242