11259
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 16940
- Proper Divisor Sum (Aliquot Sum)
- 5681
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7452
- Möbius Function
- 0
- Radical
- 417
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- no
- Odd
- yes
Appears in sequences
- a(n+1) = a(n)-th composite number, with a(0) = 1.at n=34A006508
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=21A020342
- Denominators of continued fraction convergents to sqrt(709).at n=9A042365
- Numbers whose base-4 representation contains exactly three 2's and four 3's.at n=3A045152
- a(n) = T(6,n), array T given by A047858.at n=10A048467
- Smallest number with n decimal digits such that the product of its digits equals n * the sum of its digits, or 0 if impossible.at n=4A064500
- Sizes of successive increasing gaps between 3-smooth numbers.at n=36A084788
- Expansion of 3*x*(1+2*x)/(1-3*x-3*x^2).at n=7A085480
- Expansion of 1/sqrt(1 - 6x + 21x^2).at n=7A098340
- Numbers k such that sigma(k) plus the k-th prime is a triangular number.at n=31A115907
- Ceiling(exp(n)/n^3).at n=17A132409
- Expansion of (2-3*x)/(1-3*x-3*x^2).at n=7A172012
- E.g.f.: (3+2*sqrt(3)*exp(x/2)*sin(sqrt(3)*x/2))/(exp(-x)+2*exp(x/2)*cos(sqrt(3)*x/2)).at n=10A178963
- Wiener index of the n-sunlet graph.at n=24A180574
- André numbers. Square array A(n,k), n>=2, k>=0, read by antidiagonals upwards, A(n,k) = n-alternating permutations of length k.at n=76A181937
- Expansion of g.f.: exp( Sum_{n>=1} 3^n*(Sum_{d|n} d*x^d)^n/n ).at n=7A192891
- Numbers n such that c(n) = p_{2n}, where c(n) is the n-th Chebyshev prime and p_{2n} the 2n-th prime.at n=2A196674
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=13A217164
- Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no three of them are vertices of an equilateral triangle of any orientation. Triangle read by rows.at n=31A240439
- Number of ways to place 5 points on a triangular grid of side n so that no three of these points are vertices of an equilateral triangle of any orientation.at n=3A240442