17477
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17478
- 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
- 17476
- Möbius Function
- -1
- Radical
- 17477
- 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
- 48
- 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
- 2010
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=15A007755
- Sums of 5 distinct powers of 4.at n=27A038473
- Apart from initial terms, same as A007755, which is a better version.at n=14A040176
- Second member of a sexy prime quadruple: value of p+6 such that p, p+6, p+12 and p+18 are all prime.at n=32A046122
- Second term of balanced prime quartets: p(m)-p(m-1) = p(m+1)-p(m) = p(m+2)-p(m+1).at n=12A054801
- Smallest prime p such that n = A049108(p) = length of chain of iterates of Euler Phi starting with p.at n=14A060611
- Number of integers in {1, 2, ..., 2^n} that are coprime to n.at n=14A074933
- Primes which can be expressed as sum of distinct powers of 4.at n=21A077718
- 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=[6, 6,2]; short d-string notation of pattern = [662].at n=16A078857
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,2,6).at n=9A078965
- Prime factors of the odd terms of A007755.at n=10A092873
- Primes in A103373.at n=19A103383
- Prime differences of Lucas 4-step numbers.at n=11A113295
- G.f. x^2*(-1+x+x^2)/((1-x)*(2*x-1)*(x+1)*(x^2+1)).at n=18A115851
- Numbers k such that (14^k + 5^k)/19 is prime.at n=4A128343
- Antidiagonal sums of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j-1,k) for 2 <= k <= j.at n=28A131025
- Primes congruent to 40 mod 53.at n=40A142570
- Primes congruent to 13 mod 59.at n=36A142740
- Primes congruent to 31 mod 61.at n=35A142829
- Primes p such that continued fraction of (1+sqrt(p))/2 has period 5 : primes in A146330.at n=33A146350