17627
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17628
- 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
- 17626
- Möbius Function
- -1
- Radical
- 17627
- 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
- 53
- 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
- 2027
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of trees with n nodes and 4 leaves.at n=40A055291
- a(n) = (1/n!)*A001565(n).at n=25A094792
- a(n) = prime(A096475(n)).at n=13A096476
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 9.at n=21A109563
- Primes p such that q-p = 30, where q is the next prime after p.at n=19A124596
- Primes congruent to 40 mod 43.at n=40A142289
- Primes congruent to 2 mod 47.at n=39A142355
- Primes congruent to 31 mod 53.at n=39A142561
- Primes congruent to 45 mod 59.at n=35A142772
- Primes congruent to 59 mod 61.at n=36A142857
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-0111-0100 pattern in any orientation.at n=10A146462
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 0100-0100-1111-0010 pattern in any orientation.at n=11A147030
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 0, 0), (1, 0, 0), (1, 1, 0)}.at n=8A150300
- Primes p such that p^3 + p^2 - 1 and p^3 + p^2 + 1 are prime.at n=42A160859
- Numbers of the form prime(prime(prime(k))) with a digit sum which is prime.at n=30A162252
- Primes p such that 4*p and 6*p are each the sum of two consecutive primes.at n=27A164133
- a(n+5) = a(n+3) + a(n+2) + a(n), with a(1) = a(2) = a(3) = a(4) = a(5) = 1.at n=30A176513
- (1, 1, 2, 3, 5, 7, 11, ...) convolved with (1, 0, 1, 2, 3, 5, 7, 11, ...); given A000041 = (1, 1, 2, 3, 5, 7, ...).at n=20A179906
- Numbers k such that 2^k-61 is prime.at n=37A182156
- Primes p=prime(i) of level (1,4), i.e., such that A118534(i) = prime(i-4).at n=5A216177