16377
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 6087
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10608
- Möbius Function
- -1
- Radical
- 16377
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- no
- Odd
- yes
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0.at n=19A001590
- a(n) = a(n-1) - 2*a(n-2) with a(0) = 2, a(1) = 1.at n=26A002249
- a(n) = 4^n - n.at n=7A024037
- Consider all quadruples {a,b,c,d} which reach {k,k,k,k} in n steps under map {a,b,c,d}->{|a-b|,|b-c|,|c-d|,|d-a|}; look at max{a,b,c,d}; sequence gives minimal value of this.at n=25A045794
- a(n) = Sum_{k=0..n} T(n, k), array T as in A047080.at n=16A047081
- a(n) = T(7,n), array T given by A048483.at n=11A048490
- Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.at n=27A065678
- a(n) is the unique odd positive solution y of 2^n = 7x^2 + y^2.at n=25A077021
- Expansion of (1-x)/(1+x-x^2+x^3).at n=16A078042
- a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).at n=14A084174
- Number of bits required to represent binomial(2^n, 2^(n-1)).at n=14A112884
- Expansion of -x^2*(x^9-x^8+2*x^7-x^6+x^5-2*x^4+x^2+1) / ((x^6-x^4+x^2+1) * (x^6+x^4+x^2-1)).at n=38A114952
- Expansion of (1-4x^2)/(1+3x+4x^2).at n=13A128415
- Composite numbers that are products of distinct primes and divisible by the sum of those primes.at n=38A131647
- Convolution of A008619 and A001400.at n=33A139672
- Numbers k = p*q*r (p, q, r prime) congruent to 0 mod p+q+r.at n=25A160394
- The odd composites c such that c=q*g*j*y/2 and q+g=j*y where q,g,j,y are distinct primes.at n=29A167629
- Monotonic ordering of nonnegative differences 2^i-7^j, for 40>=i>=0, j>=0.at n=43A192118
- Monotonic ordering of nonnegative differences 4^i-7^j, for 40>= i>=0, j>=0.at n=21A192165
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 6,0,0,0,0,2,1 for x=0,1,2,3,4,5,6.at n=4A197796