9068
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15876
- Proper Divisor Sum (Aliquot Sum)
- 6808
- 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
- 4532
- Möbius Function
- 0
- Radical
- 4534
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 91
- 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
- a(n) is nonsquarefree and is sum of first k nonsquarefrees for some k.at n=38A013935
- Conjecturally, number of infinitely-recurring prime patterns on n consecutive integers.at n=32A023192
- T(n, 2*n-3), T given by A027960.at n=35A027965
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=40A050255
- Positions where number of periodic partitions increases.at n=36A059994
- a(n) = (n^3 + 6n^2 - n + 12)/6.at n=36A074742
- First differences of A084449.at n=44A084465
- a[n] =a[n-1] + 2*n*Prime[n]-n^2.at n=16A093809
- Smallest number k such that k^n is equal to the sum of n consecutive primes, or 1 if it does not exist.at n=31A123112
- Expansion of Product_{k>0} (1 - x^k)^(2^(k-1)) in powers of x.at n=23A200751
- Number of nonnegative integer arrays of length n+4 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value 4.at n=4A211831
- T(n,k)=Number of nonnegative integer arrays of length n+k+1 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value k+1.at n=25A211836
- Number of nonnegative integer arrays of length n+6 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value n+1.at n=2A211839
- Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent.at n=30A224668
- Number of nX3 0..4 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 5, and upper left element zero.at n=5A230394
- Number of nX6 0..4 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 5, and upper left element zero.at n=2A230397
- T(n,k)=Number of nXk 0..4 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 5, and upper left element zero.at n=30A230398
- T(n,k)=Number of nXk 0..4 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 5, and upper left element zero.at n=33A230398
- Number of n X 2 0..2 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=6A231747
- Number of nX7 0..2 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=1A231752