12883
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13888
- Proper Divisor Sum (Aliquot Sum)
- 1005
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11880
- Möbius Function
- 1
- Radical
- 12883
- 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
- 125
- 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+2*x+3*x^2+4*x^3+5*x^4)/(1-x-x^2-x^3-x^4-x^5).at n=13A023424
- Numbers k such that 61*2^k-1 is prime.at n=29A050556
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=38A051937
- a(n) = p^2 + p + 1 where p runs through the primes.at n=29A060800
- Partial sums of A068058 + 1.at n=41A068059
- Pentanacci numbers with initial conditions a(0)=5, a(1)=1, a(2)=3, a(3)=7, a(4)=15.at n=14A074048
- a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=23A083995
- Number of ways to split 1, 2, 3, ..., 7n into n arithmetic progressions each with 7 terms.at n=12A104433
- Period of the Lucas 3-step sequence A001644 mod prime(n).at n=29A106294
- Period of the Fibonacci 3-step sequence A000073 mod prime(n).at n=29A106302
- Unique sequence that begins with nine zeros and a 1 and has the properties that each leading term of the difference triangle is single-digit, and the concatenation of the leading terms of the difference triangle is the same as the concatenation of the digits of the sequence.at n=15A125591
- Reduced period of the Fibonacci 3-step sequence A000073 mod prime(n).at n=29A154753
- Partial sums of A007694.at n=37A174030
- Number of derangements of {1,2,...,n} having no adjacent 2-cycles and no adjacent 3-cycles (an adjacent q-cycle is a cycle of the form (i,i+1,i+2,...,i+q-1)).at n=8A177261
- Coefficient of x in the reduction by (x^2 -> x + 1) of the polynomial p(n,x) defined below at Comments.at n=9A192910
- Numbers arising in computing the Turan function of cycles of length 4.at n=30A217004
- a(n) = n + (n-1)*(n-2) + (n-3)*(n-4)*(n-5) + (n-6)*(n-7)*(n-8)*(n-9) + ... + ...*1.at n=17A239519
- Number of nX5 integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one.at n=14A266078
- Numbers k such that (23*10^k - 59)/9 is prime.at n=20A283503
- Number of dominating sets in the n-antiprism graph.at n=6A284699