16164
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 40950
- Proper Divisor Sum (Aliquot Sum)
- 24786
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 2694
- Omega Function (Ω)
- 5
- 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
- 146
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=23A024460
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=22A024468
- Numbers n such that n through n+5 have the same number of distinct prime factors.at n=17A045934
- Numbers k such that k*2^k + (k+1) is prime.at n=10A046845
- Differences between numbers k such that k and k+1 have the same sum of divisors.at n=27A054001
- Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=42A097701
- Numbers n such that the sum of the digits of Sum_{k=1..n} (k!) is divisible by n.at n=16A109657
- a(n) = Sum_{k=0..n} binomial(floor(n-2k/3), k).at n=19A137402
- Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows.at n=47A154986
- Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows.at n=52A154986
- Number of all possible tetrahedra of any size and orientation, formed when intersecting the original regular tetrahedron by planes parallel to its sides and dividing its edges into n equal parts.at n=21A216173
- Smallest k such that q=2*k*prime(n)^4+b , r=2*k*q^4+c , s=2*k*r^4+d and q, r and s are all prime numbers with b, c and d = -1 or 1.at n=27A225056
- Expansion of g.f. x*(1+x+x^2)/(1-x^3-x^5).at n=57A226503
- Numbers k such that Bernoulli number B_{k} has denominator 1919190.at n=11A295595
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=12A303724
- a(n) is the number of smallest parts in the overpartitions of n having odd smallest part.at n=18A335730
- a(n) is the number of distinct radii of circles passing through at least three points in a square grid of n X n points.at n=18A357301
- Number of tilings of a 3 X n strip with dominos and U-shaped pentominos.at n=14A385242