12860
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27048
- Proper Divisor Sum (Aliquot Sum)
- 14188
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5136
- Möbius Function
- 0
- Radical
- 6430
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 169
- 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
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k platforms (i.e., UHD, UHHD, UHHHD, ..., where U=(1,1), D=(1,-1), H=(2,0)).at n=33A104546
- Half-sum (or average) of cubes of two distinct odd primes.at n=31A138855
- Number of permutations of floor(i*5/3), i=0..n-1, with all sums of two and three adjacent terms respectively unique.at n=7A147926
- Number of nondecreasing arrays of n 1..n integers with the sum of their 5th powers equal to sum(i^5,i=1..n).at n=20A216643
- Number of admissible 2-dimensional lattice patterns of type Sigma(2,3,5).at n=13A220843
- Number of set partitions of [n] such that no part contains two elements with a circular distance less than three.at n=11A261478
- Numbers n such that Bernoulli number B_{n} has denominator 330.at n=35A272183
- Number of n X 3 0..1 arrays with each 1 adjacent to 0, 2 or 4 king-move neighboring 1s.at n=6A296720
- Number of nX7 0..1 arrays with each 1 adjacent to 0, 2 or 4 king-move neighboring 1s.at n=2A296724
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 2 or 4 king-move neighboring 1s.at n=38A296725
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 2 or 4 king-move neighboring 1s.at n=42A296725
- Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=10A300085
- Number of separable partitions of n in which the number of distinct (repeatable) parts is > 1.at n=35A325716
- a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal pyramidal numbers in exactly n ways, or 0 if no such integer exists.at n=10A350210
- Expansion of g^2/(1 - x*g)^3, where g = 1+x*g^3 is the g.f. of A001764.at n=6A391172