16460
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 34608
- Proper Divisor Sum (Aliquot Sum)
- 18148
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6576
- Möbius Function
- 0
- Radical
- 8230
- Omega Function (Ω)
- 4
- 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
- 115
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=50A036806
- Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n.at n=33A049287
- Numbers k such that 2^k - 3 is prime.at n=37A050414
- Number of binary strings of length n with equal numbers of 00010 and 00110 substrings.at n=15A164213
- Partial sums of A000608.at n=8A174118
- Number of (n+2) X 3 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=35A184540
- a(n) = n*(21*n-17)/2.at n=40A226491
- Number of partitions p of n such that max(p) - 3*min(p) is a part of p.at n=42A238627
- Number of (n+2) X (1+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=26A253503
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 1.at n=40A259577
- Number of circulant graphs on n vertices up to Cayley isomorphism.at n=33A285620
- Triangle read by rows giving the sum of the number of k-matchings of the graphs obtained by deleting one edge and its two vertices from the ladder graph L_n = P_2 X P_n in all possible ways.at n=39A318243
- Number of compositions of n where neighboring runs have different lengths.at n=19A335443
- a(n) = Sum_{k=1..n} 4^(gcd(k, n) - 1).at n=7A343490
- Square array T(n,k), n >= 1, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} k^(floor(n/j) - 1).at n=73A345032
- a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such integer exists.at n=20A360217
- Number of partitions of n that do not have a fixed point that is also a fixed point of the conjugate partition.at n=37A374782
- a(n) = Sum_{k=0..n} (k+1) * binomial(k,4*(n-k)).at n=14A392076
- a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,2*(n-2*k)).at n=28A392251