9568
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 11600
- 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
- 4224
- Möbius Function
- 0
- Radical
- 598
- Omega Function (Ω)
- 7
- 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
- 122
- 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
- Numbers k such that 123*2^k+1 is prime.at n=19A032411
- Numbers whose set of base-9 digits is {1,4}.at n=38A032821
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 4 (mod 5).at n=47A035568
- Numbers having four 1's in base 9.at n=28A043460
- Pisot sequence L(9,10).at n=24A048592
- a(n) = Sum_{k >= 0} 2^k * binomial(k+2,n-2*k).at n=16A061279
- Lexicographically earliest increasing sequence of relatively prime numbers with nondecreasing number of divisors. a(0) = 1, tau(a(n+1)) >= tau(a(n)) and GCD(a(n),a(n+1)) = 1.at n=43A076963
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,1}.at n=18A080005
- Number of partitions into a square number of parts.at n=43A089333
- Expansion of (1-x)/((1-x)^2-3x^3).at n=13A097116
- Numbers n such that 2*10^n + 4*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=8A102955
- Sums of area and perimeter of primitive Pythagorean triples.at n=43A105521
- Number of runs of 0's of odd length in all ternary words of length n.at n=8A119916
- 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, 1), (0, 0, -1), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150616
- a(n) is the least number k such that k*n+1 is a prime dividing n^n+1.at n=23A187024
- Expansion of e.g.f.: Product_{n>=1} (1 - x^(2*n-1))^(-1/(2*n-1)).at n=7A206303
- Number of n X n 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=4A207558
- Number of nX5 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=4A207561
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=40A207564
- Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=4A207566