12632
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23700
- Proper Divisor Sum (Aliquot Sum)
- 11068
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6312
- Möbius Function
- 0
- Radical
- 3158
- Omega Function (Ω)
- 4
- 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
- 125
- 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
- Series for second perpendicular moment of square lattice.at n=12A006734
- Powers of cube root of 17 rounded down.at n=10A018024
- Schoenheim bound L_1(n,n-4,n-5).at n=30A036830
- a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.at n=34A057534
- Smallest integer >= 0 of the form x^3 - n^4.at n=31A070930
- Numbers k such that A109631(k) + A109631(k+1) = A109631(k+2).at n=11A109651
- Numbers n such that the numerator of Sum_{i=1..n} (1/i^2), in reduced form, is prime.at n=25A111354
- a(0) = 6, a(1) = 17, a(n+1) = a(n) + a(n-1) for n>0.at n=15A166025
- Number of ways to place 5 nonattacking bishops on a 5 X n board.at n=5A172210
- Leading column of triangle in A176463.at n=16A176503
- Number of idempotent 3 X 3 -n..n matrices.at n=6A223455
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 4.at n=46A240013
- a(n) = (n + 1)*(6*n^2 + 15*n + 4)/2.at n=15A269232
- Triangle read by rows: T(n,k) = number of parity alternating partitions of [n] into k blocks (1 <= k <= m).at n=60A274310
- Number of ways to choose a strict rooted partition of each part in a strict rooted partition of n.at n=25A301754
- a(n) = 1*2 + 3 + 4*5 + 6 + 7*8 + 9 + 10*11 + 12 + ... + (up to n).at n=46A305189
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^(n/gcd(k, n)).at n=29A342541
- Integers k such that there are i groups of order k+i up to isomorphism, for i=1,2,3.at n=7A373649
- Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2*n.at n=30A384968