11749
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12160
- Proper Divisor Sum (Aliquot Sum)
- 411
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11340
- Möbius Function
- 1
- Radical
- 11749
- 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
- 55
- 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
- a(n) = (d(n)-r(n))/5, where d = A026040 and r is the periodic sequence with fundamental period (4,0,4,3,4).at n=53A026042
- Numbers k such that 155*2^k+1 is prime.at n=18A032454
- Denominators of continued fraction convergents to sqrt(292).at n=8A041549
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=0A045307
- a(n) = 6*n^2 + 3*n + 1.at n=44A085473
- Record indices of the ratio A002375(n) / n (Goldbach conjecture related).at n=42A137820
- 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, -1, 1), (1, 1, 0)}.at n=9A148744
- Partial sums of A023200.at n=34A172112
- Semiprime centered triangular numbers.at n=33A184481
- Number of n X 6 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=6A223836
- Number of 7 X n 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=5A223843
- Number of partitions p of n such that 2*(number of even numbers in p) = (number of odd numbers in p).at n=46A241653
- Number of (n+1) X (5+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=6A250608
- Number of (n+1) X (7+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=4A250610
- a(n) is the least k such that A295520(k) = n.at n=32A295793
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A296555
- Number of permutations p of [n] whose absolute displacements |p(i)-i| are square numbers.at n=12A324375
- Number of maximal intersecting antichains of subsets of {1..n}.at n=6A326363
- Numbers m such that twice the number of unordered Goldbach partitions of 2m equals the number of unordered Goldbach partitions of 4m.at n=44A335250
- Expansion of g.f. A(x) satisfying Sum_{n=-oo..+oo} (-1)^n * (x^n + 10*A(x))^n = 1 + 12*Sum_{n>=1} (-1)^n * x^(n^2).at n=4A370042