16160
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 38556
- Proper Divisor Sum (Aliquot Sum)
- 22396
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6400
- Möbius Function
- 0
- Radical
- 1010
- Omega Function (Ω)
- 7
- 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
- 66
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 63.at n=30A031561
- Numbers n such that 57*2^n-1 is prime.at n=27A050554
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves.at n=27A055364
- Position of sqrt(n) in the mapping N2QuQR1 given in A065936.at n=6A065938
- Antidiagonal sums of table A083362.at n=31A083364
- Number of binary trees (each vertex has 0, or 1 left, or 1 right, or 2 children) with n edges and having all leaves at the same level.at n=11A106376
- Numbers whose anti-divisors sum to a perfect cube.at n=25A109351
- Number of imprimitive (periodic) 2n-bead black-white reversible necklaces with n black beads.at n=22A115120
- 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, 0), (-1, -1, 1), (0, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=8A150013
- a(n) = 2^n - n*(n+2).at n=14A176778
- a(1)=5, a(2)=2, a(n) = 5*a(n-1) + 2*a(n-2).at n=6A189746
- Column 0 of square array A211970 (in which column 1 is A000041).at n=28A211971
- Number of partitions of n into exactly 5 different parts with distinct multiplicities.at n=27A212116
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=38A287541
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=44A287541
- E.g.f.: A(x,y) = exp(-1-y) * Sum_{n>=0} (exp(n*x) + y)^n / n!, where A(x,y) = Sum_{n>=0} x^n/n! * Sum_{k=0..n} T(n,k)*y^k, as a triangle of coefficients T(n,k) read by rows.at n=18A326600
- Triangle read by rows: T(n,k) is the number of digraphs on n labeled nodes with k arcs and a global source and sink, n >= 1, k = 0..max(1,n-1)*(n-2)+1.at n=22A350791
- G.f. satisfies A(x) = 1 + x*A(x)^4*(1 + x*A(x)^2).at n=6A365181
- a(n) = sum of 2^(k-1) such that floor(n/prime(k)) is odd.at n=43A371906
- Numbers k such that the total number of digits d in the numbers from 1 to k is even for each d from 0 to 9.at n=33A380642