11407
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 1985
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9600
- Möbius Function
- -1
- Radical
- 11407
- 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
- 55
- 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
- no
- Odd
- yes
Appears in sequences
- Number of strict 3rd-order maximal independent sets in cycle graph.at n=43A007392
- Number of permutations that are 3 "block reversals" away from 12...n.at n=5A007975
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k.at n=25A057214
- a(n) = (1/6)*(2*n - 3)*(n + 2)*(n + 1).at n=34A058373
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=29A076425
- Number of permutations of n elements whose unsigned reversal distance is k.at n=39A115755
- The arithmetic mean of the n-th and (n+1)-st cubes, rounded down.at n=22A147656
- 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, -1, -1), (1, 1, 0)}.at n=8A149986
- Sums of prime points found in four grids in each corner of a square.at n=35A161190
- Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x + d)^n - (x - d)^n)/(2*d), where d = sqrt(x+4).at n=60A162517
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {0,1}.at n=35A209991
- Number T(n,k) of standard Young tableaux for partitions of n into exactly k distinct parts; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.at n=44A219311
- Number of standard Young tableaux for partitions of n into exactly 4 distinct parts.at n=2A219317
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes I, U, X.at n=18A247124
- Partial sums of A256970.at n=30A256971
- a(0)=0, then a(n) = smallest odd k > a(n-1) such that 6*k^prime(n)-1 is prime.at n=36A283676
- Number of edge covers in the ladder graph P_2 x P_n.at n=5A286911
- Array read by antidiagonals: T(m,n) = number of edge covers in the grid graph P_m X P_n.at n=22A286912
- Array read by antidiagonals: T(m,n) = number of edge covers in the grid graph P_m X P_n.at n=26A286912
- Numbers k such that 44*10^k + 3 is prime.at n=20A291606