11434
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17154
- Proper Divisor Sum (Aliquot Sum)
- 5720
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5716
- Möbius Function
- 1
- Radical
- 11434
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 65.at n=10A020404
- Compose the natural numbers with themselves, A(x) = B(B(x)) where B(x) = x/(1-x)^2 is the generating function for natural numbers.at n=8A030267
- Starting from generation 6 add previous and next term yielding generation 7.at n=40A048453
- Number of 0's in odd position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=17A129720
- Row sums of triangle A134511.at n=17A134512
- 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, 0, 0), (-1, 1, 0), (0, 0, -1), (1, 0, 0)}.at n=10A148511
- First result not divisible by 4 when iterating k -> k+tau(k) from 2(2n-1)^2.at n=37A165495
- Riordan array (1, x*(1-x)/(1-3*x+x^2)).at n=46A188137
- Records in A087669.at n=31A192230
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210740; see the Formula section.at n=53A210739
- Values of x in A216363.at n=34A216382
- Number of partitions p of n such that median(p) >= multiplicity(max(p)).at n=34A240211
- Number of nX6 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A279739
- T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=39A279741
- Number of 4Xn 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A279744
- Number T(n,k) of tilings of a 2 X n X n box using k bricks of shape 2 X 1 X 1 and 2*(n^2-k) bricks of shape 1 X 1 X 1; triangle T(n,k), n>=0, 0<=k<=n^2, read by rows.at n=12A287152
- Composite numbers k such that phi(x) = psi(k)*phi(k) has no solution.at n=5A292714
- Least number k such that the arithmetic derivatives of the composite numbers k-n and k+n are equal.at n=38A296341
- Solution (a(n)) of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + b(n); see Comments.at n=29A305330
- Number of partitions of n with ten parts in which no part occurs more than twice.at n=31A320598