13627
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
- 13628
- 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
- 13626
- Möbius Function
- -1
- Radical
- 13627
- 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
- 63
- 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
- 1611
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=35A023282
- Discriminants of imaginary quadratic fields with class number 17 (negated).at n=26A046014
- Area under Motzkin paths.at n=6A057586
- Prime divisors of solutions to 10^n == 1 (mod n).at n=8A066364
- a(n) = Sum_{d|n} phi(d^3).at n=26A068963
- a(n), for n > 1, equals the least prime p such that p - a(n-1) is a cube, a(1)=2.at n=19A076201
- Expansion of 1/(1 - 2*x - 2*x^2 - 3*x^3).at n=9A077834
- Numbers k such that k + prime(k) gives a triangular number.at n=44A115882
- Numbers n such that A064168(n) is prime.at n=69A123538
- Primes p such that (3^p - 3^((p + 1)/2) + 1)/7 is prime.at n=6A125743
- Primes congruent to 15 mod 41.at n=34A142212
- Primes congruent to 39 mod 43.at n=39A142288
- Primes congruent to 44 mod 47.at n=28A142395
- Primes congruent to 6 mod 53.at n=27A142536
- Primes congruent to 57 mod 59.at n=29A142784
- Primes congruent to 24 mod 61.at n=26A142822
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-0111-0001-0001 pattern in any orientation.at n=11A147284
- Primes p such that p1 = ceiling(p/2) + p is prime and p2 = floor(p1/2) + p1 is prime.at n=34A158714
- Consecutive pairs of prime point sums in A161191 (includes triples).at n=26A161192
- Primes of the form 18*p+1, where p is also a prime.at n=37A165811