12562
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20592
- Proper Divisor Sum (Aliquot Sum)
- 8030
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5700
- Möbius Function
- -1
- Radical
- 12562
- 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
- yes
- 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
- 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
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=28A022905
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (composite numbers).at n=21A025091
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 4).at n=46A035547
- Number of partitions satisfying cn(1,5) < cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) < cn(0,5) + cn(2,5) + cn(3,5).at n=37A039872
- Smallest composite that when added to sum of prime factors reaches a prime after n iterations.at n=39A050710
- Members of A000124 which are multiples of 11.at n=28A083511
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=47A090495
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1.at n=25A098485
- Binomial transform of tau(n) (see A000005).at n=12A101509
- Sums of three consecutive hexagonal numbers.at n=45A129109
- Partial sums of A002522, starting at n=1.at n=32A145066
- 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), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=8A150125
- Limiting number of graphs with m+n nodes and m connected components as m tends to infinity.at n=7A201968
- Number of (n+2) X (2+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=12A258960
- Triangle read by rows: T(n,k) = number of column-convex polyominoes with perimeter n and k columns (1 <= k <= n).at n=33A259332
- Greatest integer whose square root is less than or equal to Sum_{j=0..n} sqrt(j).at n=30A338277