11553
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15408
- Proper Divisor Sum (Aliquot Sum)
- 3855
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7700
- Möbius Function
- 1
- Radical
- 11553
- 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
- 143
- 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
- Integers n > 10563 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10563.at n=0A063064
- Third row of Pascal-(1,3,1) array A081578.at n=38A081585
- Bases for the cubes arising in A083203.at n=10A083204
- Semiprimes of the form 2*n + 1, where n is a square.at n=32A111351
- Semiprimes (A001358) whose digit reversal is a triangular number.at n=34A115741
- a(1) = 4; a(n) is smallest semiprime > 3*a(n-1).at n=7A117916
- Maximum number of points visible from some point in a cubic n x n x n lattice.at n=23A141227
- a(n) = 361*n + 1.at n=31A158310
- a(n) = 32*n^2 + 1.at n=19A158575
- a(n) = Sum_{k=0..floor(n/2)} C(n-k,k)^4.at n=7A181546
- Number of (n+2)X3 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..1 introduced in row major order.at n=2A205266
- Number of (n+2)X5 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..1 introduced in row major order.at n=0A205268
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..1 introduced in row major order.at n=3A205273
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..1 introduced in row major order.at n=5A205273
- Period of the sequence of the digital roots of Fibonacci n-step numbers.at n=10A210456
- Numbers x such that the base 10 representation of x^2 forms an arithmetic sequence when split into equal-sized chunks.at n=1A244660
- Number of 3Xn 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=8A279743
- Number of distinct terms in row n of A049455.at n=21A293165
- Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=4A299004
- Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=3A299005