12583
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
- 2
- Divisor Sum
- 12584
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12582
- Möbius Function
- -1
- Radical
- 12583
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 262
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1503
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of terms in 7th derivative of a function composed with itself n times.at n=9A022817
- Number of terms in n-th derivative of a function composed with itself 10 times.at n=7A024210
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026703.at n=12A026711
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=23A031830
- Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 5).at n=48A035556
- Matrix 10th power of partition triangle A008284.at n=21A050304
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=25A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=27A059665
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=19A059668
- Frobenius number of the subsemigroup of the natural numbers generated by successive pairs of Fibonacci numbers.at n=8A059769
- Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 8.at n=4A068173
- Balanced primes of order six.at n=14A096698
- Balanced primes of order eight.at n=24A096700
- Balanced primes (A090403) of index 3.at n=11A096707
- Consider primes p such that integer part of the volume of cube with faces of area p is prime; sequence gives integer part of volumes.at n=11A107989
- Numbers n such that ((1+I)^n+1)/(2+I) is a Gaussian prime.at n=24A124112
- Primes p such that (2^p + 2^((p+1)/2) + 1)/5 is prime.at n=7A124165
- Primes of the form 88x^2+32xy+127y^2.at n=23A140630
- Primes p such that p - 6^2, p - 6, p + 6 and p + 6^2 are also primes.at n=32A141279
- Primes congruent to 37 mod 41.at n=35A142234