15776
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34020
- Proper Divisor Sum (Aliquot Sum)
- 18244
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7168
- Möbius Function
- 0
- Radical
- 986
- Omega Function (Ω)
- 7
- 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
- 53
- 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
- Coordination sequence for root lattice B_12.at n=2A022154
- Sums of 4 distinct powers of 5.at n=17A038476
- Numbers n such that 59*2^n-1 is prime.at n=11A050555
- Number of 3-element proper antichains (i.e., antichains such that every two members have nonempty intersection) on an unlabeled n-element set.at n=15A056782
- a(n) = Sum_{k=0..n} T(k)*T(n-k), where T is A000073; convolution of A000073 with itself.at n=17A073778
- Number of 3 X 3 magic squares (with distinct positive entries) having all entries < n.at n=50A108576
- Sequence A154690 adjusted to leading one:t(n,m)=A154690(n,m)-A154690(n,0)+1.at n=59A174669
- Number of (n+1)X3 0..3 arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum.at n=1A185569
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum.at n=4A185571
- Number of (n+1) X 3 0..3 arrays with every 2 X 2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock sums.at n=1A188368
- T(n,k)=Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock sums.at n=4A188370
- Number of n X 7 binary arrays without the pattern 0 1 diagonally or antidiagonally.at n=4A188822
- Number of 5 X n binary arrays without the pattern 0 1 diagonally or antidiagonally.at n=6A188827
- Least number k not divisible by 10 such that the decimal expansion of k^n contains some digit exactly n times.at n=30A243151
- 25-gonal pyramidal numbers: a(n) = n*(n+1)*(23*n-20)/6.at n=16A256645
- Numbers which are representable as a sum of seventeen but no fewer consecutive nonnegative integers.at n=19A270302
- a(n) = ((n+2)/2)*Sum_{k=0..n/2}(Sum_{i=0..n-2*k} binomial(k+1,n-2*k-i)*binomial(k+i,k))/(k+1).at n=15A270715
- Least number x such that x^n has n digits equal to k. Case k = 7.at n=30A285454
- Number of circular binary sequences of length n with an even number of 0's and no three consecutive 1's.at n=16A366044
- Numbers x such that there exist three integers 0<x<=y<=z and t>0 such that sigma(x)^2 = sigma(y)^2 = sigma(z)^2 = x^2 + y^2 + z^2 + t^2.at n=25A385531