11380
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23940
- Proper Divisor Sum (Aliquot Sum)
- 12560
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4544
- Möbius Function
- 0
- Radical
- 5690
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).at n=25A025122
- Expansion of 1/((1-2x)(1-9x)(1-10x)(1-11x)).at n=3A028021
- a(n) = n * [1 + sum(k=1 to n-1) prime(k)].at n=20A083719
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+569)^2 = y^2.at n=6A101152
- Expansion of f(x, -x^4) / phi(-x^2) in powers of x where f(, ) and phi() are Ramanujan theta functions.at n=50A122135
- Has two properties: concatenation of its digits is same string as concatenation of digits of its first differences and every number appears exactly one of the sequence or its first differences.at n=35A139310
- Number of right triangles on a (n+1)X6 grid.at n=14A189810
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=38A191111
- Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component or all components by the same positive integer; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=24A229345
- Number of lattice paths from {n}^n to {0}^n using steps that decrement one component or all components by the same positive integer.at n=3A229346
- Number of lattice paths from {n}^3 to {0}^3 using steps that decrement one component or all components by the same positive integer.at n=3A229482
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=15A245209
- Molien series for invariants of finite Coxeter group A_12.at n=48A266781
- Numbers n such that Bernoulli number B_{n} has denominator 330.at n=31A272183
- Number of compositions (ordered partitions) of n into octagonal numbers (A000567).at n=48A322800
- Integers which can be written in exactly three ways as sum of two distinct nonzero pentagonal numbers.at n=9A333013
- Number of integer partitions of n with as many even parts as even conjugate parts.at n=46A350948
- a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero square pyramidal numbers in exactly n ways, or -1 if no such integer exists.at n=14A360218
- E.g.f. satisfies A(x) = 1/(1 - x * A(x)^4 * exp(x*A(x)^4)).at n=4A377631