11249
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
- 4
- Divisor Sum
- 12864
- Proper Divisor Sum (Aliquot Sum)
- 1615
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9636
- Möbius Function
- 1
- Radical
- 11249
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 86
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 94.at n=31A020433
- Numbers k such that Fib(k) == -13 (mod k).at n=38A023167
- Least m such that if r and s in {1/4, 1/8, 1/12, ..., 1/4n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=40A024839
- Centered 16-gonal numbers.at n=37A069129
- 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=13A072494
- Third row of Pascal-(1,7,1) array A081582.at n=19A081593
- (p*q - 1)/2 where p and q are consecutive odd primes.at n=33A102770
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, for n>4: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5)], where SORT places digits in ascending order and deletes 0's.at n=33A108566
- (Product of twin primes - 1)/2.at n=11A120876
- Concatenate Motzkin numbers (A001006).at n=4A132939
- a(n) = 343*n - 70.at n=32A157374
- a(n) = 18*n^2 - 1.at n=24A157910
- a(n) = 50*n^2 - 1.at n=14A157919
- a(n) = 625*n - 1.at n=17A158374
- Number of binary strings of length n with no substrings equal to 0000 0011 or 0110.at n=13A164427
- Number of strings of numbers x(i=1..6) in 0..n with sum i^2*x(i)^2 equal to n^2*36.at n=29A184244
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+x+y>=0.at n=14A211612
- Number of nX4 0..2 arrays with no more than floor(nX4/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=5A222367
- Number of nX6 0..2 arrays with no more than floor(nX6/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=3A222369
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=39A222371