10788
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 16092
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 5394
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 161
- 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
- Positive numbers k such that k and 8*k are anagrams in base 9 (written in base 9).at n=3A023085
- Perimeters of more than one primitive Pythagorean triangle.at n=15A024408
- a(n) = n*(2*n+5)*(2*n+7).at n=12A035329
- Numbers k such that phi(k)*d(k) is a multiple of sigma(k), where d(k) is the number of divisors of k.at n=39A050934
- Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives j values.at n=11A054209
- a(n) is the number of distinct (modulo geometric D3-operations) nonsymmetric (no reflective nor rotational symmetry) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=15A060552
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=21A063048
- a(n) = (3/2)*a(n-1) if a(n-1) is even; (3/2)*(a(n-1)+1) if a(n-1) is odd.at n=20A070885
- a(1) = 1; a(n) = Sum_{k=1..n-1} a(floor((n-1)/k)).at n=45A078346
- Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=14A084277
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=22A088753
- Ratios of consecutive row products of triangle A094275.at n=6A094279
- Numbers n such that sigma(n) = 8*phi(n).at n=6A104901
- a(n) = 60*(n^5/120 + n^4/24 + n^3/6 + n^2/2 + n + 1).at n=5A127883
- a(n) = A121295(n) - A121265(n).at n=11A131012
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=47A146773
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=52A146773
- Row sums of A163233 and A163235.at n=24A163242
- Number of 2 X 2 matrices M of positive integers such that permanent(M) < n.at n=44A212151
- Number of n X 4 0..1 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=4A223313