6574
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10440
- Proper Divisor Sum (Aliquot Sum)
- 3866
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3096
- Möbius Function
- -1
- Radical
- 6574
- 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
- 75
- 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
- a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.at n=29A027917
- Numbers k such that 67*2^k+1 is prime.at n=26A032383
- Number of days in n years (n=4 is the first leap year).at n=17A033171
- Number of days in n years (n=3 is the first leap year).at n=17A033172
- Numbers whose base-5 representation contains exactly three 2's and two 4's.at n=20A045291
- a(n) = round(sqrt(a(n-2)^2 + a(n-1)^2)) with a(0) = 1 and a(1) = 2.at n=35A063827
- Non-balanced numbers in A015765.at n=30A074868
- a(n) = A077731(n)^(1/2).at n=3A077732
- Number of partitions of n into Fibonacci number of integer parts.at n=39A102848
- "Rounded hypotenuses": a(n) = round(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=34A104804
- a(n) = numerator of the coefficient c(n) of x^n in (tan x)/Product_{0 < k < n} 1 + c(k)*x^k, n = 1, 2, 3, ...at n=6A170918
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=17A178980
- Numbers 1 through 10000 sorted lexicographically in ternary representation.at n=26A190128
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=10A197540
- Numbers n such that Q(sqrt(n)) has class number 10.at n=40A218042
- Number of distinct values of the sum of i^2 over 9 realizations of i in 0..n.at n=27A225276
- Numbers k such that 6^k + k^6 + 1 is prime.at n=13A243934
- Numbers n such that the smallest prime divisor of n^2+1 is 97.at n=26A248552
- a(n) = 3*B*C*(n mod A) + 5*A*C*(n mod B) + 2*A*B*(n mod C) with A=7, B=11, C=17.at n=28A256668
- Number of 3Xn 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=12A302681