12631
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 761
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11872
- Möbius Function
- 1
- Radical
- 12631
- Omega Function (Ω)
- 2
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=27A020431
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 3).at n=46A035535
- Successive left concatenation of floor(k/2) beginning with n until we reach 1.at n=11A068657
- Numbers n such that RevBinary(RevDecimal(n))=RevDecimal(RevBinary(n)), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).at n=44A081433
- Number of Proth primes < 2^n.at n=32A214120
- a(n) = number of triples (a,b,c) of natural numbers a,b,c <= n with gcd(a,b)=gcd(b,c)=gcd(c,a)=1.at n=34A256390
- Numbers n such that n!!! - 3^9 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=24A267029
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1006", based on the 5-celled von Neumann neighborhood.at n=30A273861
- Number of maximal irredundant sets in the n-path graph.at n=24A291055
- Number of permutations of [n] avoiding {1324, 2431, 3142}.at n=9A294819
- Number of lone-child-avoiding locally disjoint unlabeled rooted trees with n vertices.at n=21A331680
- Numbers k such that k, k + 1 and k + 2 are all norm-deficient in Gaussian integers (A332572).at n=41A332574
- Non-palindromic numbers m such that m * repunit of length k is palindromic for all large enough k.at n=50A370053