11629
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12060
- Proper Divisor Sum (Aliquot Sum)
- 431
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11200
- Möbius Function
- 1
- Radical
- 11629
- 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
- 143
- 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
- Odd 9-gonal (or enneagonal) numbers.at n=29A028991
- a(n) is the number whose base-2 representation is d(0)d(1)...d(n), where d=A005614 (the infinite Fibonacci word).at n=13A044432
- 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, 0), (-1, -1, 1), (-1, 1, -1), (1, -1, 0), (1, 1, 1)}.at n=8A149527
- G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum{d|n} A(2^d*n*x/d)^d/d]*x^n ).at n=5A162287
- a(n) = 8*n^2 + 2*n + 1.at n=38A188135
- G.f. A(x) satisfies: x = Sum_{n>=1} x^n*A(-x)^sigma(n), where sigma(n) = sum of divisors of n (A000203).at n=8A193038
- Beach-Williams Pell numbers of type pq (p,q primes).at n=8A212078
- Positions of 2 in sequence A217916.at n=19A217918
- Total sum of parts of multiplicity 4 in all partitions of n.at n=33A222732
- Positions of records in A166133.at n=29A256404
- Numbers n such that A166133(n) sets a new record and also satisfies A166133(n)=A166133(n-1)^2-1.at n=14A256422
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 1.at n=53A284687
- Linear recurrence with signature (1,1,-1,1,1), where the first terms are powers of 2 (1,2,4,8,16).at n=18A294364
- Numbers k such that 8*10^k - 79 is prime.at n=18A294572
- Partial sums of A299287.at n=16A299288
- a(n) = binomial(n + 4, n - 1) + 1.at n=15A323228
- Positive integers k such that 11^k == 2 (mod k).at n=5A333134
- 9-gonal numbers that are semiprimes.at n=8A356424
- a(n) is the integer w such that (c(n)^2, -d(n)^2, w) is a primitive solution to the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 11^3, where c(n) = F(n+2) + (-1)^n * F(n-3), d(n) = F(n+3) + (-1)^n * F(n-2) and F(n) is the n-th Fibonacci number (A000045).at n=7A356717
- Numbers k such that k and k+2 are both A000120-perfect numbers (A175522).at n=14A360639