12637
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12638
- 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
- 12636
- Möbius Function
- -1
- Radical
- 12637
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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
- 1509
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones.at n=14A031840
- Euclid-Mullin sequence (A000945) with initial value a(1)=31 instead of a(1)=2.at n=15A051315
- Numbers n such that n and prime(n) end with the same three digits.at n=9A067841
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=18A078852
- The quadruples (d1,d2,d3,d4) with elements in {2,4,6} are listed in lexicographic order; for each quadruple, this sequence lists the smallest prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4), if such a prime exists.at n=13A078866
- Sorted version of A078866.at n=25A078867
- Primes p such that the differences between the 5 consecutive primes starting with p are (4,6,6,6).at n=0A078957
- Suppose p and q = p+22 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 51 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.at n=48A079021
- Number of distinct lines through the origin in 3-dimensional cube of side length n.at n=24A090025
- Index of first occurrence of n-th prime in A001203, the continued fraction for Pi.at n=35A107892
- a(n) = 8*n^2 - 4*n - 3.at n=39A118057
- Number of partitions of n having no parts equal to the size of their Durfee squares.at n=42A118199
- Primes of the form 210k + 37.at n=28A140847
- Primes congruent to 38 mod 43.at n=33A142287
- Primes congruent to 41 mod 47.at n=35A142392
- Primes congruent to 44 mod 49.at n=33A142451
- Primes congruent to 23 mod 53.at n=27A142553
- Primes congruent to 42 mod 55.at n=40A142631
- Primes congruent to 11 mod 59.at n=25A142738
- Primes congruent to 10 mod 61.at n=27A142808