11492
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 23058
- Proper Divisor Sum (Aliquot Sum)
- 11566
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 442
- Omega Function (Ω)
- 5
- 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
- Shifts left under inverse Euler transform.at n=37A038071
- Sum of a(n) terms of 1/k^(4/5) first exceeds n.at n=28A056180
- a(0) = 1, a(n+1) = a(n) + next prime larger than a(n).at n=12A074839
- a(n) = A000217(A000217(n))-n^2.at n=17A086602
- A127790(n)/2.at n=14A127811
- Integers of the form A164577(k)/3.at n=24A164619
- Totally multiplicative sequence with a(p) = 9p-1 for prime p.at n=17A166658
- Records of minima of positive distance d between a square cubefree integer y and a cube of positive and squarefree integer x and such d = y^2 - x^3.at n=8A179107
- Arises in covering a graph by forests and a matching.at n=15A179259
- Number of (w,x,y) with all terms in {0,...,n} and w>floor((x+y)/3).at n=25A212974
- Primitive integer length of the side of an origin-centered square that contains inside its boundary a point with integer coordinates that is an integer distance from three of the four corners.at n=11A215365
- n - (sum of prime factors of n^2+1) is a positive square.at n=34A216896
- a(n) = 17*n^2.at n=26A244630
- Number of (n+2)X(1+2) 0..4 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=1A251878
- Number of (n+2)X(2+2) 0..4 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=0A251879
- T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=1A251885
- T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=2A251885
- Primitive values n such that the square with opposite corners (0,0) and (n,n) contains a point (x,y) with integer coordinates, with 0 < x,y < n, at an integer distance from three of the four corners.at n=20A260549
- T(n,k) = number of linear arrays of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.at n=36A283613
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square grid such that the center of gravity of the k picked positions coincides with one of the picked positions.at n=25A291716