15700
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
- 18
- Divisor Sum
- 34286
- Proper Divisor Sum (Aliquot Sum)
- 18586
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 1570
- Omega Function (Ω)
- 5
- 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
- 27
- 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
- Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=25A020875
- T(n,n-1), array T as in A047150.at n=8A047153
- Number of ways to place 3 nonattacking queens on a 3 X n board.at n=28A061989
- List of codewords in binary lexicode with Hamming distance 6 written as decimal numbers.at n=30A075934
- Solution to the Dancing School Problem with 3 girls and n+3 boys: f(3,n).at n=25A079908
- Structured snub dodecahedral numbers.at n=9A100151
- Euler's totient of prime(n)! / prime(n)# + 1.at n=4A103896
- Triangle read by rows: coefficient of x^n in the Taylor expansion of x/(1 - m*x - x^4) in row n, column m=1..n+2.at n=40A117742
- a(1)=1, a(n)=a(n-1)+n^1 if n odd, a(n)=a(n-1)+ n^4 if n is even.at n=10A140146
- G.f. satisfies: A(x) = x + A(A(A(x))^2).at n=6A141371
- Averages of two consecutive even cubes: (n^3 + (n+2)^3)/2.at n=12A173961
- First string of 43 consecutive composite numbers.at n=16A177949
- Floor((n+1/n)^3).at n=24A197602
- a(n) = round((n+1/n)^3).at n=24A197986
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,2,2,1.at n=20A222109
- Number of nX3 0..1 arrays with no more than floor(nX3/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order.at n=7A222698
- T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order.at n=47A222703
- T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order.at n=52A222703
- Expansion of Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * x^(5*k).at n=24A248193
- Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k.at n=29A297526