15280
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 35712
- Proper Divisor Sum (Aliquot Sum)
- 20432
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6080
- Möbius Function
- 0
- Radical
- 1910
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- a(0) = 10; for n > 0, a(n) is determined by the rule that the concatenation of the leading terms of the difference triangle is the same as the concatenation of the digits of the sequence.at n=12A125588
- Number of 4-step self-avoiding walks on an n X n square summed over all starting positions.at n=21A188149
- Numbers k such that 3^k + 100 is prime.at n=44A219618
- Number of pairs of functions f, g from a size n set into itself satisfying f(g(x)) = f(f(g(x))).at n=4A239781
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 0.at n=39A259574
- a(n) = A273059(4n+2).at n=21A275918
- G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies A(x) = 1/(1 - a(0)*x^a(0)/(1 - a(1)*x^a(1)/(1 - a(2)*x^a(2)/(1 - ...)))), a continued fraction.at n=12A291419
- Number of pairs of integer partitions of n where every part of the first is less than every part of the second.at n=24A322440
- G.f. satisfies 1 = Sum_{n>=0} ((1+x)^(n*(n-1)/2) / A(x)^n) * (2^n/3^(n+1)).at n=4A325287
- G.f. = Phi^4*F^2, where Phi = g.f. for A028930, F = g.f. for A028959.at n=13A328533
- a(n) = a(n-1) + a(n-3) unless a(n-1) and a(n-3) are both even in which case a(n) = (a(n-1) + a(n-3))/2, with a(0) = a(1) = a(2) = 1.at n=35A341312
- Number of subsets of {1..n} containing n such that some element can be written as a positive linear combination of the others.at n=46A365042