16414
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25560
- Proper Divisor Sum (Aliquot Sum)
- 9146
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7896
- Möbius Function
- -1
- Radical
- 16414
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1/((1+x)*(1-x)^10).at n=8A001781
- Number of nodes of odd outdegree in all ordered rooted (planar) trees with n edges.at n=8A014300
- A tree-node counting triangle.at n=46A109244
- Length of the n-th Zimin word (A082215(n)).at n=13A123121
- A Fine number related number triangle.at n=36A124392
- Integer part of Gauss's Arithmetic-Geometric Mean M(2,n^4).at n=18A127765
- a(n) = floor(n*3^(n/2)).at n=12A128443
- Number left factors of Dyck paths of length n and having no hills; a hill is a (1,1)-step starting at level 0 and followed by a (1,-1)-step.at n=17A191526
- Number of 4 X n 0..1 arrays with rows unimodal and columns nondecreasing.at n=8A225011
- Number of partitions p of n such that median(p) >= multiplicity(min(p)).at n=40A240216
- Number of (n+1) X (4+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.at n=12A250738
- Bernoulli number B_{n} has denominator 354.at n=39A255684
- G.f. A(x) satisfies: A(x) = 1/(1 - x*A(x)/(1 - x^2*A(x)^2/(1 - x^3*A(x)^3/(1 - x^4*A(x)^4/(1 - ...))))), a continued fraction.at n=9A301627
- Inverse Euler transform of the Euler totient function phi = A000010.at n=29A320778
- Product_{n>=1} (1 + x^n)^a(n) = 1 + Sum_{n>=1} phi(n) * x^n, where phi = A000010.at n=28A328774
- a(n) = Sum_{1 <= i <= j <= k <= n} gcd(i,j,k).at n=39A344521
- a(n) is the rank of the US English name of n when all its letters are written in all possible orders and arranged in alphabetic order.at n=22A351025
- Product_{n>=1} (1 + a(n)*x^n) = 1 + Sum_{n>=1} phi(n)*x^n, where phi = A000010.at n=28A353925
- Product_{n>=1} 1 / (1 - a(n)*x^n) = 1 + Sum_{n>=1} phi(n)*x^n, where phi = A000010.at n=28A353948
- G.f. A(x) = exp( Sum_{k>=1} A360238(k) * x^k/k ), where A360238(k) = [y^k*x^k/k] log( Sum_{m>=0} (m + y)^(2*m) * x^m ) for k >= 1.at n=4A360239