11106
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24102
- Proper Divisor Sum (Aliquot Sum)
- 12996
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3696
- Möbius Function
- 0
- Radical
- 3702
- Omega Function (Ω)
- 4
- 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
- 130
- 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
- Numbers k such that 87*2^k+1 is prime.at n=27A032393
- Numbers whose base-7 representation contains exactly four 4's.at n=10A043412
- Numbers k such that 5*2^k + 3 is prime.at n=48A058586
- Partial sums of repdigits of A002283.at n=3A099676
- Numbers k such that the k-th triangular number contains only digits {1,6,7}.at n=13A119141
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7.at n=35A135192
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149296
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150069
- a(n) is the smallest number k such that d(1)*1! + d(2)*2! + ... + d(p)*p! = n^2, where d(i) are the decimal digits of k.at n=26A198095
- Number of ways to linearly arrange the trees over all forests on n labeled nodes.at n=6A218688
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood.at n=34A272278
- a(n) = PrimePi(n^3) - PrimePi(n)^3, where PrimePi = A000720.at n=54A291538
- Numbers obtained by adding the first k repdigits that consist of the same digit, for some number k.at n=35A346535
- a(n) = n+1 for n = 1 to 8; a(n) = 100 + a(n-8) for n = 9 to 16; thereafter a(8*i+j) = 10^(i+1) + a(8*(i-1)+j) for i >= 2, 1 <= j <= 8.at n=28A367342
- G.f. satisfies A(x) = -(A(x^3) + A(x^4)) / A(-x^2).at n=46A385915