8988
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 15204
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2544
- Möbius Function
- 0
- Radical
- 4494
- 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
- 78
- 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 nonseparable rooted toroidal maps with n + 3 edges and n + 1 vertices.at n=6A006408
- Number of partitions of 2n with all subsums different from n.at n=22A006827
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=31A025102
- Number of derangements of n where minimal cycle size is at least 3.at n=8A038205
- Numbers having three 8's in base 10.at n=34A043523
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly three ways.at n=6A076456
- a(n) = smallest multiple of 4 with sum of digits = n.at n=32A077489
- Non-balanced numbers in A015771.at n=15A078549
- Positions of sevens (ground states) in A084451.at n=19A084449
- Largest n-digit number - largest n-digit triangular number.at n=7A095866
- 3*Volume of the root-n Waterman polyhedron of void-center type as defined in A119870.at n=42A119878
- 3*Volume of the root-n Waterman polyhedron of void-center type as defined in A119870.at n=43A119878
- Triangle T(n,k) read by rows ; multiply row n of Pascal's triangle (A007318) by A024175(n).at n=33A120493
- Triangle T(n,k) read by rows ; multiply row n of Pascal's triangle (A007318) by A024175(n).at n=30A120493
- a(n) = 10*binomial(n,2) + 9*n.at n=42A135705
- Expansion of psi(q^2) / f(-q)^2 in powers of q where psi(), f() are Ramanujan theta functions.at n=16A137829
- Row sums of Riordan array (c(-x^2),xc(-x^2)^2)^(-1) where c(x) is the g.f. of A000108.at n=12A138164
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=9A148406
- a(n) = 343*n - 273.at n=26A157369
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=21A162705