11429
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12480
- Proper Divisor Sum (Aliquot Sum)
- 1051
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10380
- Möbius Function
- 1
- Radical
- 11429
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=41A049750
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=48A050967
- Integer part of (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=45A062482
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=45A062483
- Numbers k such that k! + prime(k) is prime.at n=27A064278
- Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.at n=37A067354
- Triangle read by rows: The n-th row is constructed by forming the partial sums of the previous row, reading from the right and if n is a triangular number repeating the final term.at n=39A099964
- Triangle read by rows: The n-th row is constructed by forming the partial sums of the previous row, reading from the right and if n is a triangular number repeating the final term.at n=40A099964
- First column (also row sums) of triangle in A099964.at n=12A099965
- Numbers k such that k + prime(k) gives a triangular number.at n=40A115882
- a(0)=1, a(1)=0, a(2)=1, a(n) = a(n-1) + a(n-2) + 3*a(n-3).at n=14A123102
- Antidiagonal sums of the convolution array A213768.at n=12A213770
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=10A217164
- Number of 6 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 6 X n array.at n=15A220036
- Optimal ascending continued fraction expansion of sqrt(43) - 6.at n=6A228932
- Number of composite Lucas numbers between the prime Lucas numbers A005479(n) and A005479(n+1).at n=47A245472
- Number of (n+2)X(1+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=8A253417
- T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=36A253424
- Expansion of Product_{k>=1} (1 + x^k + x^(3*k)).at n=50A264905
- Numbers k such that k!/(k-2) - 1 is prime.at n=21A291322