6952
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
- 16
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 7448
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3120
- Möbius Function
- 0
- Radical
- 1738
- 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
- 31
- 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
- Number of ways to partition n labeled elements into pie slices of odd sizes allowing the pie to be turned over.at n=8A032264
- Sum of first n primes of form 4k-1.at n=39A038347
- T(n,n-6), where T is the array in A055830.at n=9A055833
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=36A056068
- Total number of parts in all partitions of n into prime parts.at n=47A084993
- Non-cubefree numbers k such that 2k+1 is also non-cubefree (A046099).at n=50A115170
- Triangle read by rows: T(n,k) is number of ternary words of length n and having k runs of 0's of odd length (0 <= k <= ceiling(n/2); a run of 0's is a subsequence of consecutive 0's of maximal length).at n=31A119914
- a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^3 if n is even.at n=14A140149
- Ulam's spiral (ENE spoke).at n=21A143856
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, 1), (1, 0, -1), (1, 0, 1)}.at n=7A150421
- First terms "a" of quadruples a>b>c>d>0 with six square pairwise sums.at n=12A175534
- Floor(1/{(7+n^4)^(1/4)}), where {}=fractional part.at n=22A184631
- T(n,k)=Number of n-step one or two space at a time bishop's tours on a kXk board summed over all starting positions.at n=50A187046
- Number of 6-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=4A187050
- Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x+1 and 4x-3 are in a.at n=50A191132
- Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=3A207893
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=39A207895
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=5A207897
- Sophie Germain 5-almost primes.at n=6A211162
- Number of representations of n as a sum of products of distinct pairs of positive integers, considered to be equivalent when terms or factors are reordered.at n=37A211856