11361
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17344
- Proper Divisor Sum (Aliquot Sum)
- 5983
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- -1
- Radical
- 11361
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=40A005892
- Number of steps to compute n-th prime in PRIMEGAME (slow version).at n=7A007547
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=38A031568
- Interprimes (A024675) which are of the form s*prime, s=21.at n=28A075296
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=27A084048
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^((3*p-1)/3)) = (3*p-1)*(column p of T), or [T^((3*p-1)/3)](m,0) = (3*p-1)*T(p+m,p) for all m>=1 and p>=0.at n=16A107717
- Column 1 of triangle A107717.at n=4A107718
- Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n.at n=46A111389
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=40A118312
- Numbers k such that k*Lucas(k) + 1 is prime.at n=25A134696
- a(n) = 7*n^2 + 4*n + 1.at n=41A135704
- Triangle read by rows, T(n, k) = binomial(n, k) * Sum_{j=0..n-k} E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n.at n=30A154921
- Third column of A154921.at n=5A154931
- Number of lines through at least 2 points of a 6 X n grid of points.at n=37A160846
- Partial sums of A138202.at n=20A164940
- Triangle relating to ordered Bell numbers, A000670.at n=26A208744
- Numbers k such that 9^k + 10 is prime.at n=17A217492
- Number of n X 3 0..2 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=3A224305
- T(n,k)=Number of nXk 0..2 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=18A224310
- Number of 4Xn 0..2 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=2A224312