10960
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
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 25668
- Proper Divisor Sum (Aliquot Sum)
- 14708
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4352
- Möbius Function
- 0
- Radical
- 1370
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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 connected functions of n points with no fixed points and with no symmetries.at n=13A032177
- 16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).at n=40A051868
- Number of ways of pairing the squares of the numbers 1 to n with the squares of the numbers n+1 to 2n such that each pair sums to a prime. Because an odd square must always be added to an even square to obtain a prime, this sequence is the product of A077763 and A077764.at n=20A077762
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)+1 are twin primes with p(h) = h-th prime.at n=28A129310
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 9.at n=28A136830
- Total number of permutations on {1,2,...,n} that have a unique longest increasing subsequence.at n=7A167995
- A(x) satisfies A005408(x) = A(x)/A(x^2), A005408 = odd numbers.at n=20A173283
- Stirling-like sequence obtained from bipartite 0-1 tableaux.at n=23A180401
- Number of n X 2 binary arrays with every one adjacent to another one horizontally, diagonally, antidiagonally or vertically.at n=6A202789
- Number of nX7 binary arrays with every one adjacent to another one horizontally, diagonally, antidiagonally or vertically.at n=1A202794
- T(n,k)=Number of nXk binary arrays with every one adjacent to another one horizontally, diagonally, antidiagonally or vertically.at n=29A202795
- T(n,k)=Number of nXk binary arrays with every one adjacent to another one horizontally, diagonally, antidiagonally or vertically.at n=34A202795
- Number of (n+2) X 5 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=17A204749
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|<|x-y|+|y-z|.at n=11A212571
- Triangle of generalized Stirling numbers S_{n,n}(5,k) read by rows (n>=0, n<=k<=5n) the sum of which is A182924.at n=42A216379
- Numbers k such that the first 9 digits of the k-th Lucas number are 1-9 pandigital.at n=1A216489
- Triangle read by rows: coefficients of polynomials Q_n(x) arising in study of Riemann zeta function.at n=16A217940
- T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any king-move neighbor in a random 0..3 nXk array.at n=29A219569
- T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any king-move neighbor in a random 0..3 nXk array.at n=34A219569
- Number of partitions p of n such that 2*min(p) is not a part of p.at n=38A238594