12651
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16872
- Proper Divisor Sum (Aliquot Sum)
- 4221
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8432
- Möbius Function
- 1
- Radical
- 12651
- 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
- a(n+1) = (2n+3)*a(n) - 2n*a(n-1) + 8n, a(0) = 1, a(1) = 3.at n=5A007566
- Positive numbers having the same set of digits in base 7 and base 10.at n=37A037440
- a(n) = A077741(n)/n.at n=33A077742
- a(n) = first term which reduces to an unchanging value in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n).at n=15A091049
- Integer part of the area of consecutive prime sided isosceles triangles.at n=38A097442
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=22A116037
- Square array, read by antidiagonals, where row n+1 equals the partial sums of the sequence resulting from removing the terms in the first column and main diagonal from row n, for n>=0, with row 0 consisting of all 1's.at n=59A130462
- Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.at n=25A130604
- a(n) = 1 + (6 + (11 + (6 + n)*n)*n)*n/24.at n=22A145126
- a(n) = n^3 + (1-n)^2.at n=23A168297
- Number of nondecreasing arrangements of 7 numbers x(i) in -(n+5)..(n+5) with the sum of sign(x(i))*2^|x(i)| zero.at n=15A187991
- Number of digits in the decimal expansion of the number of partitions of 3^n.at n=17A248729
- Expansion of g.f. (1-2*x+51*x^2)/(1-x)^3.at n=23A257352
- Expansion of (1 + x + 21*x^2 + x^3 + x^4)/(1 - x)^5.at n=10A257602
- Numbers k such that (28*10^k - 43)/3 is prime.at n=27A271377
- Number of ways to choose disjoint strict rooted partitions of each part in a strict rooted partition of n.at n=31A301756
- Numbers k such that 479*2^k+1 is prime.at n=20A319488
- Numbers k such that the binary representations of 1/k and 1/(k+1) have the same period (A007733).at n=42A333745
- a(n) = Sum_{k=0..n} k^k * binomial(n, k)^2.at n=5A336955
- a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} gcd(x_1, x_2, n)/gcd(x_1, x_2, x_3, n).at n=22A373061