17361
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25760
- Proper Divisor Sum (Aliquot Sum)
- 8399
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11556
- Möbius Function
- 0
- Radical
- 1929
- Omega Function (Ω)
- 4
- 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
- 79
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 base 31 n-digit numbers with adjacent digits differing by two or less.at n=5A126418
- Triangle T(n, k) = T(n-1, k-1) + 3*T(n-1, k) + 2*T(n-1, k-1), with T(n,1) = T(n, n) = 1, read by rows.at n=31A142596
- Triangle T(n, k) = T(n-1, k-1) + 3*T(n-1, k) + 2*T(n-1, k-1), with T(n,1) = T(n, n) = 1, read by rows.at n=32A142596
- Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2^n into powers of 2 less than or equal to 2^k.at n=73A152977
- Numbers such that n^2 = 29 mod 1193.at n=29A165989
- Number of (n+3)X10 binary arrays with every 4X4 subblock commuting with each horizontal and vertical neighbor 4X4 subblock.at n=9A188103
- Number of partitions of 2^n into powers of 2 less than or equal to 16.at n=7A210773
- Minimum value unattainable as the sum of 3 attained values of a*b*c with a,b,c 0..n integers.at n=19A225265
- Number of (2+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=8A250814
- 1/n! times the number of ordered pairs of permutation functions f,g on n elements where f(f(x)) = g(f(g(x))).at n=19A255515
- Smallest positive integer that has exactly n representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=12A317385
- Number of compositions of n into parts with distinct multiplicities and with exactly nine parts.at n=16A321779
- Numbers k that can be written as the sum of a perfect square and a factorial in at least 2 distinct ways.at n=30A358071
- a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly 2 ways.at n=15A377729
- Truncated centered square numbers: a(n) = 14*n^2 - 22*n + 9.at n=35A389928