11477
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12000
- Proper Divisor Sum (Aliquot Sum)
- 523
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10956
- Möbius Function
- 1
- Radical
- 11477
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=23A020429
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=39A024845
- Number of binary [ n,5 ] codes of dimension <= 5 without zero columns.at n=12A034339
- Denominators of continued fraction convergents to sqrt(642).at n=6A042233
- Counterexamples to the conjecture that an even, prime-indexed triangular plus 1 equals a prime or that an odd, prime-indexed triangular minus 2 equals a prime.at n=12A097785
- a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[a(n) + a(n-1) + a(n-2) + a(n-3)], where SORT places digits in ascending order and deletes 0's.at n=34A108564
- Expansion of g.f. (1 - x + x^2)/((1-3*x)*(x-1)^2).at n=8A108765
- Number of connected simple graphs with n vertices, n+7 edges, and vertex degrees no more than 4.at n=9A112442
- Row 4 of table A162430.at n=20A162433
- a(n) = 8*n^2 - 2*n + 1.at n=38A185438
- Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having one or three distinct values for every i<=n and j<=n.at n=10A211476
- Number of (w,x,y,z) with all terms in {0,...,n} and w=2*floor((x+y+z)/2).at n=38A212748
- First appearance of the Fibonacci numbers in the decimals of Pi.at n=17A216638
- Where records occur in A246702.at n=22A246703
- Expansion of Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * x^(2*k).at n=15A246840
- Halogen sequence: a(n) = A018227(n)-1.at n=38A271999
- Number of maximal independent vertex sets (and minimal vertex covers) in the n-web graph.at n=13A287498
- Numbers k such that 479*2^k+1 is prime.at n=17A319488
- Number of separable partitions of n that consist of an odd number of parts.at n=38A325724
- a(n) is the smallest integer m, such that for every sufficiently large integer k, A165370(729*k+n) can be written as m followed by zero or more 9's.at n=23A346789