11248
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 23560
- Proper Divisor Sum (Aliquot Sum)
- 12312
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 1406
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=35A026054
- Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.at n=37A035008
- A038175/2.at n=7A038176
- Smallest number m with nonzero digits such that A046810(m)=n.at n=14A046813
- Number of 4-block ordered tricoverings of an unlabeled n-set.at n=36A060488
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 9 (most significant digit on right).at n=7A061938
- Numbers k such that the product of the digits of k is equal to the sum of the prime factors of k, counted with multiplicity.at n=27A065774
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).at n=12A072494
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).at n=36A088003
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.at n=41A092230
- a(n) = 512*n - 16.at n=21A157447
- Row sums of A163357 and A163359.at n=23A163365
- The fourth row of the ED1 array A167546.at n=11A167547
- First of quadruples of consecutive happy numbers.at n=2A194352
- Number of nX4 0..4 arrays with each element equal to the number its horizontal and vertical zero neighbors.at n=9A197050
- a(n) = n*(5*n^2 - 3*n + 4) / 6.at n=24A203552
- Number of partitions p of n such that max(p)-min(p) = 5.at n=50A218568
- Power ceiling sequence of 2+sqrt(7).at n=5A218987
- Numbers for which the cube of the sum of the digits is equal to the square of the product of their digits.at n=4A241846
- a(n) = n*(67*n - 89)/2.at n=19A263227