12592
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 24428
- Proper Divisor Sum (Aliquot Sum)
- 11836
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6288
- Möbius Function
- 0
- Radical
- 1574
- Omega Function (Ω)
- 5
- 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
- 63
- 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 57*2^k + 1 is prime.at n=25A002274
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) = cn(4,5)).at n=54A036818
- A 2nd-order recursion: a(1)=a(2)=1; a(n) = prime(a(n-1)) + primepi(a(n-2)) = A000040(a(n-1)) + A000720(a(n-2)).at n=9A082094
- C(n-3,3)+C(n-7,7)+...+C(n-(4*floor((n-4)/4)+3),4*floor((n-4)/4)+3).at n=23A101552
- Row sums of a Pascal-Thue-Morse triangle.at n=15A114226
- Riordan array (1/(1-2*x), x*(1+x)/(1-2*x)).at n=48A121574
- a(n) = tau(n) * (NumberOfPartitions(n) - 1).at n=24A141668
- Expansion of 1/(1 - x*A002296(x)).at n=6A186184
- Number of n X n array permutations with each element moving one space diagonally, horizontally or vertically.at n=3A189347
- Number of nX4 array permutations with each element moving one space diagonally, horizontally or vertically.at n=3A189350
- T(n,k) is the number of n X k array permutations with each element moving one space diagonally, horizontally or vertically.at n=24A189355
- Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005).at n=43A190267
- Let K be a local ring with a principal maximal ideal J of nilpotent degree 2 with |K/J|>2; a(n) = number of D-invariant ideals in the ring R_n(K,J).at n=5A221701
- Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (maximal part of p).at n=43A240313
- G.f.: 1 / AGM(1-5*x+x^2, 1+3*x+x^2).at n=8A246652
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=33A271772
- 5-untouchable numbers.at n=28A284187
- p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S^4.at n=22A291379
- Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k.at n=27A297526
- a(n) is n times the minimum moment of inertia of an n-celled polyomino about an axis through the center of mass perpendicular to the plane of the polyomino, with a unit point mass in the center of each of the cells.at n=42A365964