12965
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15564
- Proper Divisor Sum (Aliquot Sum)
- 2599
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10368
- Möbius Function
- 1
- Radical
- 12965
- 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
- 169
- 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
- Related to series-parallel networks.at n=8A006350
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=30A020384
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 13.at n=22A051978
- McKay-Thompson series of class 12F for Monster.at n=12A058484
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=48A090495
- Number of prime knots with <= n crossings.at n=12A116584
- a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + Sum_{j=1..2^m} a(j).at n=35A139485
- Hypotenuses c of primitive Pythagorean Triples (a,b,c) such that 2*a+1, 2*b+1 and 2*c+1 are primes.at n=30A165238
- E.g.f.: Sum_{n>=0} ((1+x)^n - 1)^n / n!.at n=5A192935
- Numbers of the form ((6k+5)^2+9)/2 or 2(3k+4)^2-9.at n=52A214493
- A255454(2^n-1).at n=7A255455
- a(n) = a(n-2) + a(n-3) for n >= 3, with a(0) = a(1) = 2, a(2) = 1.at n=33A276477
- Number of ways to choose a strict partition of each part of a strict partition of n.at n=23A279785
- Number of weakly unimodal compositions of n in which the greatest part occurs exactly seven times.at n=53A320318
- Number of integer solutions to (x_1)^2 + (x_2)^2 + ... + (x_10)^2 <= n.at n=5A341399
- T(n,k) is the number of parking functions of length n with cars parking at most k spots away from their preferred spot; square array T(n,k), n>=0, k>=0, read by downward antidiagonals.at n=51A365623
- Number of parking functions of length n with cars parking at most 3 spots away from their preferred spot.at n=6A365626
- a(n) = numerator of AM(n)-HM(n), where AM(n) and HM(n) are the arithmetic and harmonic means of the first n positive integers.at n=8A368372
- Expansion of e.g.f. -exp(x) * LambertW(-2*x)/2.at n=5A372333
- Euler transform of A016116 = 2^floor(n/2).at n=18A392561