2592
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 7623
- Proper Divisor Sum (Aliquot Sum)
- 5031
- 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
- 864
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 9
- Little Omega Function (ω)
- 2
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
- yes
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = n^2*Product_{p|n} (1 + 1/p).at n=35A000082
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=33A000423
- Jordan-Polya numbers: products of factorial numbers A000142.at n=40A001013
- a(n) = 2*n^2.at n=36A001105
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=38A002569
- Values of phi(k) when phi(k) = phi(k+1).at n=16A003275
- Values of phi(k) when phi(k) = phi(k+1).at n=15A003275
- a(n) = 2*n^(n-2).at n=5A003308
- Numbers that are the sum of 2 positive 4th powers.at n=23A003336
- 3-smooth numbers: numbers of the form 2^i*3^j with i, j >= 0.at n=50A003586
- Numbers that are the sum of at most 2 nonzero 4th powers.at n=31A004831
- Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=14A005934
- Number of isomorphism classes of connected 3-regular multigraphs of order 2n, loops allowed.at n=5A005967
- Numbers k such that phi(k) divides k.at n=43A007694
- Coordination sequence for D_8 lattice.at n=2A008361
- Molien series for A_9.at n=29A008632
- Number of partitions of n into at most 9 parts.at n=29A008638
- Triangle T(n,k), n>=1, read by rows, where T(n,k) is the number of lattice polygons with area n and perimeter 2*k.at n=29A008855
- a(n) = Product_{i=0..8} floor((n+i)/9).at n=22A009714
- Values of n where (phi(n) * sigma(n))/n is an integer and increases.at n=40A015707