12572
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 12628
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 6286
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- 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) = (n+1)*(5*n^2+4*n+1).at n=13A027849
- Least term in period of continued fraction for sqrt(n) is 8.at n=30A031432
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=40A049779
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=31A078184
- a(n) = 16n^2 + n.at n=27A157474
- a(n) = 64*n^2 + 2*n.at n=14A158070
- a(n) = 784*n^2 + 28.at n=4A158659
- Numbers m such that m and m+22 have the same sum of divisors.at n=38A172333
- Convolved with its aerated variant of two zeros between terms = A000041.at n=43A174068
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=15A175356
- a(n) = total number of binary sequences S of length n and curling number k (so S = XY^k) in which Y can be taken to have length 1.at n=13A217932
- (8*n^3 + 3*n^2 + n) / 6.at n=20A219054
- Number n such that the sum of its proper evil divisors (A001969) equals n.at n=20A230587
- Number of binary words of length n with exactly 6 (possibly overlapping) occurrences of the subword given by the binary expansion of n.at n=22A236235
- a(n) = Sum_{m=0..floor((n-1)/2)} prime((n-m)(n-m-1)/2+m+1).at n=23A249490
- Triangle read by rows, Bell transform of second order Bell numbers (A187761).at n=39A264430
- Numbers k such that (11*10^k - 137)/9 is prime.at n=15A293687
- Number of integer partitions of n whose product is a powerful number.at n=41A330106
- a(n) = Sum_{d|n} d^(n/d) * (n/d)^d.at n=13A359863
- Triangle T(n,k) read by rows: T(n,k) is the coefficient of x^k of the monic polynomial (1+x)^n + ((2*(1+x))^n - (2+x)^n) / x.at n=38A391610