10572
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24696
- Proper Divisor Sum (Aliquot Sum)
- 14124
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3520
- Möbius Function
- 0
- Radical
- 5286
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- 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
- Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2.at n=4A001397
- a(n) is the index of the smallest triangular number containing exactly n 8's.at n=4A048363
- Numbers k such that 2^k - 3 is prime.at n=34A050414
- Gabcke sequence: a(0)=1; (n+1) a(n+1) = Sum_{k=0..n} 2^(4k+1) |E(2k+2)| a(n-k), where |E(2k+2)| are Euler numbers (E(2k)=(-1)^k A000364(k)).at n=3A087617
- Expansion of 1 / ((1-x-x^2-x^3)*(1-x^2-x^3)).at n=15A103322
- Expansion of (1+x)c(x^2)/((1-xc(x^2))*sqrt(1-4x^2)), c(x) the g.f. of A000108.at n=13A117186
- Numbers k such that the k-th triangular number contains only digits {5,7,8}.at n=8A119225
- G.f. A(x) satisfies: A(A(x)) = 3*A(x) - 2*x - x^2 with A(0)=0.at n=6A138739
- a(n) = 961*n + 1.at n=10A158414
- 1/6 the number of (n+1)X7 0..2 arrays with every 2X2 subblock containing all three values.at n=0A183600
- T(n,k)=1/6 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock containing all three values.at n=15A183603
- T(n,k)=1/6 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock containing all three values.at n=20A183603
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208339; see the Formula section.at n=63A209687
- Number of 0..n arrays of length 7 with each element differing from at least one neighbor by 1 or less, starting with 0.at n=8A221686
- O.g.f.: Sum_{n>=0} n^n*(n+3)^n * exp(-n*(n+3)*x) * x^n / n!.at n=4A222077
- Triangle read by rows: Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2k.at n=16A227715
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n+4, p + q = k, and p the least such prime >= k/2.at n=35A234956
- Number of nX3 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A281649
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=18A281653
- Number of 4 X n 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A281656