11030
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19872
- Proper Divisor Sum (Aliquot Sum)
- 8842
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4408
- Möbius Function
- -1
- Radical
- 11030
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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
- yes
- Odd
- no
Appears in sequences
- Convolution of primes with themselves.at n=19A014342
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 42.at n=4A031720
- Multiples of 5 with digit sum 5.at n=27A069540
- Numbers beginning with a vowel in French.at n=32A118557
- a(n) = t(n)_t(n) where t() = triangular numbers A000217.at n=13A122628
- {2n+1}_{2n+1}.at n=52A122643
- a(n) = 25*n^2 + 5.at n=20A158445
- Number of n X n symmetric binary arrays with rows, considered as graycode numbers, in strictly increasing order, and no more than 2 ones in any row or column.at n=9A162110
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2>=x^2+y^2.at n=35A211636
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=12A245209
- The number of length-n permutations avoiding the patterns 1234, 1324, 1432 and 3214.at n=10A260696
- Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having length of first column k (n>=2, k>=1).at n=68A273342
- Solution of the complementary equation a(n) = a(n-2) + b(0) + b(1) + ... + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=46A295055
- Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) = number of interior vertices where exactly five lines cross.at n=50A336491
- a(n) is the number of numbers greater than 1 and up to prime(n)^2 whose prime factors are all less than or equal to prime(n).at n=39A342163