12763
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
- 12764
- 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
- 12762
- Möbius Function
- -1
- Radical
- 12763
- 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
- 1523
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of graphs with n nodes and n-1 edges.at n=11A001433
- Expansion of layer susceptibility series for square lattice.at n=10A007288
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=24A007996
- Primes of the form n^2 - 6.at n=18A028880
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=16A031838
- Primes p such that the decimal digits of p^2 can be partitioned into two or more nonzero squares.at n=31A048646
- Primes prime(k) for which A049076(k) = 4.at n=9A049080
- Primes for which A049076 >= 4.at n=15A049090
- Largest prime below prime(n)^2 (A001248).at n=29A054270
- The first of two consecutive primes with equal digital sums.at n=29A066540
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 12.at n=11A095673
- Primes p such that index of p, the sum of p's digits and the number of p's digits are all primes.at n=39A109982
- Primes in A023108(n); or Lychrel primes.at n=31A135316
- Primes congruent to 12 mod 41.at n=38A142209
- Primes congruent to 35 mod 43.at n=35A142284
- Primes congruent to 26 mod 47.at n=34A142377
- Primes congruent to 23 mod 49.at n=35A142433
- Primes congruent to 43 mod 53.at n=30A142573
- Primes congruent to 3 mod 55.at n=40A142603
- Primes congruent to 52 mod 57.at n=41A142697