11404
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19964
- Proper Divisor Sum (Aliquot Sum)
- 8560
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5700
- Möbius Function
- 0
- Radical
- 5702
- Omega Function (Ω)
- 3
- 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
- 29
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- 6-dimensional centered tetrahedral numbers.at n=9A008500
- Number of ordered quadruples of integers from [ 2,n ] with no global factor.at n=21A015638
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 86 ones.at n=7A031854
- Numbers having four 4's in base 6.at n=27A043388
- a(n) = a(n-2) + 2*a(n-3), n > 3; with a(0)=0, a(1)=1, a(2)=2, a(3)=0.at n=24A134271
- Erroneous version of A141347.at n=17A140465
- Positive integers n such that the sum S of 1 and first n^2-1 odd primes is divisible by n and S/n == n (mod 2).at n=17A173079
- Number of partitions of n into exactly 6 different parts with distinct multiplicities.at n=20A212117
- Partitions with parts repeated at most twice and repetition only allowed if first part has an even index (first index = 1).at n=52A227135
- Number of partitions of n where the difference between consecutive parts is at most 7.at n=35A238867
- Number of length n+6 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=31A255997
- a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.at n=39A259013
- Smallest k > 1 such that the initial n digits in the decimal expansions of Pi and Pi^k coincide.at n=3A291095
- Smallest k > 1 such that the initial n digits in the decimal expansions of Pi and Pi^k coincide.at n=4A291095
- Numbers missing from A317416.at n=13A317418