12607
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14416
- Proper Divisor Sum (Aliquot Sum)
- 1809
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10800
- Möbius Function
- 1
- Radical
- 12607
- 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
- 156
- 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
- Number of bipartite partitions.at n=17A002762
- Pseudoprimes to base 74.at n=41A020202
- Partition n labeled elements into sets of different sizes and order the sets.at n=9A032011
- Expansion of e.g.f.: (exp(x/(1-x))*(2-x)-1+x)/(1-x)^3.at n=5A070779
- a(n) is the number of m <= 2^n which are in A075190, i.e., such that m^2 is exactly at the center between two consecutive primes, or in other words A056929(m) = 0.at n=17A101593
- Row sums of triangle A114172, where the g.f. of column n equals the g.f. of row n divided by (1-x)^(n+1).at n=10A114173
- Number of permutations of length n which avoid the patterns 1234, 3421, 4312.at n=25A116756
- Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=9.at n=32A143460
- Partial sums of A151779.at n=45A151781
- Toothpick sequence in the three-dimensional grid.at n=53A160160
- a(n)=(7/4)*(1+3*(-7)^(n-1)).at n=5A165639
- Triangle, read by rows, T(n,k) = Sum_{j=1..k} binomial(n-1, j-1)*binomial(k, j - 1)*(j-1)!.at n=26A176122
- Number of nondecreasing strings of numbers x(i=1..n) in -4..4 with sum x(i)^3 equal to 0.at n=22A188272
- Number of -n..n circular arrays x(0..5) of 6 elements with zero sums of x(i) and x(i)*x((i+1) mod 6).at n=8A202008
- Smallest positive integer k (or 0 if no such k) with conjecturally exactly n primitive cycles of positive integers under iteration by the Collatz-like 3x+k function.at n=35A226662
- Integers n such that appending some decimal digit to the first n digits of Pi results in a prime.at n=28A231336
- Positions of 3's in A234323.at n=18A234804
- Read (exponents of primes in the factorization of n!) modulo 2 and convert to decimal.at n=43A240504
- Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.at n=29A241049
- Number T(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=54A261836