16080
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 50592
- Proper Divisor Sum (Aliquot Sum)
- 34512
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 2010
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- 71
- 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
- Coordination sequence for D_4 lattice.at n=10A007900
- Number of 2n-bead black-white complementable necklaces with n black beads.at n=11A045629
- Numbers k such that phi(prime(k) + 1) == 0 (mod k).at n=15A067732
- A transform of the Jacobsthal numbers.at n=21A099508
- Self-convolution cube equals A113663, where a(n) = n*A113663(n-1) for n>=1, with a(0)=1.at n=5A113669
- a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.at n=20A124350
- Number of (directed) Hamiltonian paths in the n-Möbius ladder graph.at n=17A137883
- Terms of A061047 ending in 0.at n=24A146950
- Number of 11 X 11 arrays of squares of integers, symmetric about the diagonal and under 90-degree rotation, with all rows summing to n.at n=60A156407
- Numbers in A075728 which are not one less than some prime.at n=24A179232
- Number of primes of the form 1 + b^128 for 1 < b < 10^n.at n=6A215058
- van Heijst's upper bound on the number of squares inscribed by a real algebraic curve in R^2 of degree n, if the number is finite.at n=16A239352
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 3.at n=26A241648
- Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.at n=23A253303
- Square array A(n,k) (n>=1, k>=1) read by antidiagonals: A(n,k) is the number of n-colorings of the prism graph Y_k on 2k vertices.at n=31A277443
- Triangle read by rows, T(n, k) the coefficients of some polynomials in Pi, for n >= 0 and 0 <= k <= n.at n=43A295517
- O.g.f. A(x) satisfies: [x^n] exp( n^2 * x*A(x)^2 ) * (2 - A(x)) = 0 for n > 0.at n=4A305108
- Sum of the third largest parts in the partitions of n into 7 parts.at n=40A308931
- Triangle read by rows: T(n,k) is the number of permutations pi of [n] such that pi has k descents and s(pi) avoids the patterns 132 and 321, where s is West's stack-sorting map (0 <= k <= n-1).at n=48A319029
- Triangle read by rows: T(n,k) is the number of permutations pi of [n] such that pi has k descents and s(pi) avoids the patterns 132 and 321, where s is West's stack-sorting map (0 <= k <= n-1).at n=51A319029