10879
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 1793
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9240
- Möbius Function
- -1
- Radical
- 10879
- Omega Function (Ω)
- 3
- 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
- 130
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=21A002414
- 4-dimensional analog of centered polygonal numbers. Also number of regions created by sides and diagonals of a convex n-gon in general position.at n=24A006522
- Pseudoprimes to base 45.at n=44A020173
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=38A024845
- a(n) = (2*n+1)*(12*n+1).at n=21A033576
- Number of conjugacy classes of elements of order n in 2.E_7(C).at n=23A045515
- Numbers n such that A068861(n) = n.at n=29A068862
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=15A070193
- Numbers in ascending order formed by using all the digits of the next n numbers.at n=11A081991
- Members of A000124 which are multiples of 11.at n=26A083511
- a(n) = floor(C(n+6,6)/C(n+2,2)).at n=40A084626
- Partial sums of the large Schroeder numbers (A006318).at n=7A086616
- a(n) = binomial(n,3) - binomial(floor(n/2),3) - binomial(ceiling(n/2),3).at n=45A111384
- Numbers n such that f(n), f(n+1) and f(n+2) are prime, f(m)=72*m^2+7.at n=16A121089
- Numbers k such that k and k^2 together contain all ten digits.at n=37A122477
- A polynomial of matrices is used to make a triangular sequence. The upper triangular antidiagonal Steinbach matrices are summed over their characteristic polynomial triangular sequences to give a new sequence of matrices: the characteristic polynomials of these new summed matrices are, then, used to make up this triangular sequence.at n=15A123951
- Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.at n=28A131367
- Pyramid game person numbers that have integer solutions.at n=18A135051
- Prime terms subtracted from Fibonacci terms (ignoring first two terms of Fibonacci sequence).at n=18A160189
- Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=3A162809