12750
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 33696
- Proper Divisor Sum (Aliquot Sum)
- 20946
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3200
- Möbius Function
- 0
- Radical
- 510
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 200
- 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
- Number of minimally 2-edge-connected non-isomorphic graphs with n nodes.at n=11A001072
- Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=40A035951
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= n/3.at n=29A048000
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+1)/3.at n=29A048046
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+2)/3.at n=29A048079
- T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.at n=41A050157
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=32A055755
- Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).at n=19A067282
- Numbers n such that sigma(n) = phi(prime(n)+1).at n=23A067625
- Numbers n such that phi((prime(n)+1)/2)=sigma(n).at n=31A068473
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.at n=23A077096
- Coefficient of the irreducible character of S_m indexed by (m-2n+2,2n-2) in the n-th Kronecker power of the representation indexed by (m-2,2).at n=18A090809
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=24A097225
- Structured heptagonal diamond numbers (vertex structure 5).at n=19A100179
- Number of terms of A109858 with digit sum n.at n=15A109859
- a(n) = (1/15)*(3*Fibonacci(5*(n+1)) - 5*Fibonacci(4*(n+1))).at n=4A114878
- a(n) = binomial(n, floor(n/2)) - n*(n - 1)/2.at n=15A129937
- Numbers k such that the sum of the Carmichael lambda functions of the divisors is a proper divisor of k.at n=14A131492
- Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=17A166814
- 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=23A175356