16674
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 38208
- Proper Divisor Sum (Aliquot Sum)
- 21534
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- 1
- Radical
- 16674
- Omega Function (Ω)
- 4
- 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
- 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
- Powers of rooted tree enumerator.at n=20A000439
- Triangle of coefficients from fractional iteration of e^x - 1.at n=17A008826
- Number of quaternary codes of length 8 with n words.at n=4A034239
- Number of quaternary codes (not necessarily linear) of length n with 4 words.at n=7A034241
- Sin(n) decreases monotonically to -1.at n=28A046964
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.at n=17A061662
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=27A079037
- Numbers k such that k, k+1, k+2 and k+3 are products of 4 primes.at n=5A124728
- Beastly fax numbers: numbers containing the fax number of the Beast (667, one more than its regular number) in their decimal expansion.at n=31A138563
- The number of numerical sets S with atom monoid A(S) equal to {0,n+1,n+2,n+3,n+4,...}.at n=15A158291
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/cos(n) > a(k)/cos(a(k)), so that a(1)/cos(a(1)) > a(2)/cos(a(2)) > ... > a(k)/cos(a(k)) > ...at n=38A172446
- a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=27A172448
- Number of partitions of n+10 with largest inscribed rectangle having area <= n.at n=26A218631
- Number of unrooted self-avoiding walks of n steps on honeycomb lattice.at n=17A266925
- Number of length-n 0..6 arrays with every repeated value unequal to the previous repeated value plus one mod 6+1.at n=4A269774
- T(n,k)=Number of length-n 0..k arrays with every repeated value unequal to the previous repeated value plus one mod k+1.at n=49A269776
- Number of length-5 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1.at n=5A269777
- Convolution square of A073592.at n=35A276551
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p that are > p/2.at n=16A282722
- Numbers k such that (61*10^k - 1)/3 is prime.at n=14A295395