12783
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17048
- Proper Divisor Sum (Aliquot Sum)
- 4265
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8520
- Möbius Function
- 1
- Radical
- 12783
- 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
- 200
- 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 days in n years (n=4 is the first leap year).at n=34A033171
- Numerators of continued fraction convergents to sqrt(958).at n=6A042854
- Number of partitions of n with rank 1 (the rank of a partition is the largest part minus the number of parts).at n=51A101198
- Numbers n such that a(n) is prime, where a(n) = a(n-1) + a(n-2), a(1) = 3794765361567513, a(2) = 20615674205555510.at n=10A108156
- Number of permutations of length n which avoid the patterns 1234, 3142, 3421.at n=11A116767
- A transform of the central binomial coefficients A001405.at n=11A134184
- G.f.: A(x) = exp( Sum_{n>=1} (2^n - 1)^n * x^n/n ), a power series in x with integer coefficients.at n=4A155202
- Number of nX2 0..5 arrays with every nonzero element less than or equal to some NW, E or S neighbor.at n=3A203271
- Number of nX4 0..5 arrays with every nonzero element less than or equal to some NW, E or S neighbor.at n=1A203273
- T(n,k)=Number of nXk 0..5 arrays with every nonzero element less than or equal to some NW, E or S neighbor.at n=11A203277
- T(n,k)=Number of nXk 0..5 arrays with every nonzero element less than or equal to some NW, E or S neighbor.at n=13A203277
- Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=15A221597
- Odd numbers which are factored to the same set of primes in Z as to the irreducible polynomials in GF(2)[X]; odd terms of A235036.at n=25A235039
- Number of Grand Dyck-Motzkin paths of length n.at n=11A256943
- Number of partitions of n into an even number of relatively prime parts.at n=37A339397
- Number of grid points covered by a truncated triangle drawn on the hexagonal lattice with the short sides having length n and the long sides length 2*n.at n=44A342914