9542
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15456
- Proper Divisor Sum (Aliquot Sum)
- 5914
- 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
- 4392
- Möbius Function
- -1
- Radical
- 9542
- 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
- 104
- 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
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=43A002621
- a(n) = 10000*log_10(n) rounded down.at n=8A004228
- a(n) = 10000*log_10(n) rounded to the nearest integer.at n=8A004229
- Number of partitions of n into 8 unordered relatively prime parts.at n=40A023028
- Number of ways to place a non-attacking white and black pawn on n X n chessboard.at n=10A035290
- n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.at n=7A064977
- Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) - 9 for n > 0.at n=18A101128
- If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=34A104205
- Number of base 18 n-digit numbers with adjacent digits differing by four or less.at n=4A126513
- A binomial recursion: a(n) = p(n) (see comment).at n=6A132436
- 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), (-1, 0, 0), (0, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149349
- G.f. satisfies: A(x) = x + A(x*A(x)/(1-x)) with A(0)=0.at n=10A154836
- a(n) = n*(14*n + 3).at n=26A195025
- Rectangular array: (row n) = b**c, where b(h) = h^3, c(h) = (n-1+h)^3, n>=1, h>=1, and ** = convolution.at n=24A213558
- Principal diagonal of the convolution array A213558.at n=3A213559
- Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent.at n=31A224668
- Triangle read by rows: T(n,k) is the number of compositions of n having k distinct parts (n>=1, 1<=k<=floor((sqrt(1+8*n)-1)/2)).at n=42A235998
- Numbers k such that anti-phi(k) = anti-phi(k+1).at n=42A241003
- Number of pairs (not necessarily successors) of partitions of n that are incomparable in dominance (natural, majorization) ordering.at n=15A248476
- Number of (n+1) X (6+1) 0..1 arrays with every 2 X 2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.at n=12A253395