12817
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14656
- Proper Divisor Sum (Aliquot Sum)
- 1839
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10980
- Möbius Function
- 1
- Radical
- 12817
- 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
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8-x^9).at n=38A017831
- Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=38A035958
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=27A047826
- n plus a googol is prime.at n=38A049014
- Partial sums of round(exp(n)).at n=8A092756
- Expansion of x*(1-2*x-x^2)/( (1-x)*(1+x)*(1-3*x+x^2)).at n=13A107387
- a(n) = a(n-1) + a(n-3) + a(n-4) for n > 3, a(0) = -1, a(1) = 1, a(2) = 2, a(3) = 1.at n=22A111569
- 288*n^2 - 168*n - 119.at n=6A118059
- 3n^3 + 2n^2 + n + 1.at n=16A130884
- Numbers n such that n^2 - 1 is the product of four distinct Fibonacci numbers greater than 1.at n=17A242074
- Sum_{i=1..n} Sum_{j=1..n} (i OR j), where OR is the binary logical OR operator.at n=25A258438
- a(n) = F(n)*F(n+1) - (-1)^n, where F = A000045.at n=11A260259
- Number of maximal irredundant sets in the n-pan graph.at n=23A291102
- Irregular table read by rows, T(n, k) is the rank of the k-th Seidel permutation of {1,...,n}, permutations sorted in lexicographical order.at n=22A347600