16351
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16632
- Proper Divisor Sum (Aliquot Sum)
- 281
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16072
- Möbius Function
- 1
- Radical
- 16351
- 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
- 146
- 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
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=26A076164
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0100-0100-1111-0010-0010 pattern in any orientation.at n=17A147344
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A149315
- a(n) = ADPE(n) is the total number of aperiodic k-double-palindromes of n up to cyclic equivalence, where 1 <= k <= n.at n=26A181314
- Numbers in A206853 without proper divisors > 1 from the same sequence.at n=32A209630
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2<=x^2+y^2.at n=28A211634
- a(n) = prime(n) * prime(2*n-1).at n=22A219603
- Values of n such that L(14) and N(14) 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=39A227517
- Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts).at n=39A240448
- Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts).at n=39A240449
- G.f.: 1/((1-t^8)*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^11)*(1-t^13)*(1-t^15)).at n=67A266748
- Number of set partitions of [n] such that at least one pair of consecutive blocks (b,b+1) exists having not exactly one pair of consecutive numbers (i,i+1) with i member of b and i+1 member of b+1.at n=9A272065
- Coefficients of 1/(Sum_{k>=0} [-1 + (k+1)*r](-x)^k), where r = (3 + sqrt(5))/2 = 1 + golden ratio and [ ] = floor.at n=10A289245
- Number of irredundant sets in the n-wheel graph.at n=15A290494
- Numbers k such that A(k+1) = A(k) + 3, where A() = A005100() are the deficient numbers.at n=4A317046
- A Catalan-like sequence formed by summing the truncation of the terms of a Catalan Triangle A009766 where the number of row terms are truncated to ceiling((n+3)*log(3)/log(2)) - (n+4).at n=11A376325
- G.f. A(x) satisfies x = Sum_{n>=1} A( x^n*(1-x)^(4*n) ).at n=5A380553
- List of connected graphs that are squares, encoded as in A076184.at n=19A382194