12803
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 2557
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10440
- Möbius Function
- -1
- Radical
- 12803
- Omega Function (Ω)
- 3
- 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
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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 partitions of n into parts not of the form 23k, 23k+5 or 23k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=36A035993
- Numbers n such that binomial(2n, n) - 1 is prime.at n=39A066726
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=22A071863
- A Moessner triangle using (1, 3, 5, ...).at n=24A125750
- Partial sums of ceiling(n^2/2) (A000982).at n=42A131941
- a(1)=1, a(n)=a(n-1)+n if n even, a(n)=a(n-1)+n^2 if n is odd.at n=41A136047
- Numbers k such that A136677(k) is prime.at n=9A136686
- a(n) = (1+n)*(9 + 11*n + 4*n^2)/3.at n=20A172482
- Number of compositions of n with exactly five occurrences of the largest part.at n=17A243740
- a(n) = 2*A090495(n) - 1.at n=23A274297
- Number of compositions (ordered partitions) of n into square parts (A000290) such that no two adjacent parts are equal (Carlitz compositions).at n=58A301503
- a(n) = F(n+5) * F(n+2) - 12 * (-1)^n where F(n) = A000045(n) are the Fibonacci numbers.at n=7A343008
- Exponents k where A000120(3^k) - A070939(3^k)/2 reaches a new maximum.at n=33A372099
- Index of n-th prime in A386482, or -1 if that prime is missing.at n=48A386483
- a(n) is the index where A387090(n) appears in A386482.at n=20A386484