10541
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 211
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10332
- Möbius Function
- 1
- Radical
- 10541
- 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
- Square of the lower triangular normalized partition matrix.at n=30A027516
- Third column of A027516.at n=5A027530
- a(n) = (2*n - 1)*(3*n + 1).at n=42A033569
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=36A034857
- a(n)^2 is smallest square starting with a string of n 1's.at n=4A034978
- Numerators of continued fraction convergents to sqrt(503).at n=6A041960
- a(n)^2 is the smallest square containing exactly n 1's in its decimal notation.at n=6A048346
- n satisfying sigma(n+1) = sigma(n-1).at n=20A055574
- Numbers k such that sigma(k-1) divides sigma(k+1).at n=24A067130
- A Collatz-Fibonacci mixture: a(1) = 1, a(2) = 2, a(n+2) = a(n+1)/2+a(n)/2 if a(n+1) and a(n) have the same parity, a(n+2) = a(n+1)+a(n) otherwise.at n=39A069202
- Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.at n=10A082967
- Numbers k such that 5*10^k + 3*R_k + 6 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=8A103012
- Difference between the n-th partial sum of the squares (A000330) and the n-th partial sum of the primes (A007504).at n=32A108753
- Numbers k such that the k-th triangular number contains only digits {1,5,6}.at n=24A119133
- a(n) is the smallest positive integer whose square starts with precisely n identical digits.at n=4A119511
- Numbers whose square starts with 5 identical digits.at n=0A119866
- a(n) is the smallest positive integer whose square starts with (at least) n identical digits.at n=4A119998
- a(n) = 15*n*(n+1) + 11.at n=26A132208
- Numbers whose square starts with 4 identical digits.at n=9A132391
- a(n) = the smallest positive number, not ending in 0, whose square has a substring of exactly n identical digits.at n=4A167712