1080
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 3600
- Proper Divisor Sum (Aliquot Sum)
- 2520
- 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
- 288
- Möbius Function
- 0
- Radical
- 30
- 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
- yes
- 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
- 44
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = n*(n+3)/2.at n=45A000096
- Pentagonal numbers: a(n) = n*(3*n-1)/2.at n=27A000326
- Number of combinatorial types of simplicial n-dimensional polytopes with n+3 nodes.at n=11A000943
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^2*(1 - x^3)).at n=39A000969
- Generalized pentagonal numbers: m*(3*m - 1)/2, m = 0, +-1, +-2, +-3, ....at n=53A001318
- Highly abundant numbers: numbers k such that sigma(k) > sigma(m) for all m < k.at n=44A002093
- Numerators of Cotesian numbers (not in lowest terms): A002176*C(n,2).at n=8A002179
- q-expansion of modular form of weight 13/2: eta(8 tau)^12 * theta(tau).at n=69A002284
- a(n) = n*phi(n).at n=44A002618
- Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,0,2).at n=3A003288
- Numbers that are a sum of distinct positive cubes in more than one way.at n=47A003998
- a(n) = ceiling(1000*log_10(n)).at n=11A004227
- Ratios of successive terms are 1,1,1,2,3,3,3,4,5,5,5,6,...at n=9A004529
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=23A004923
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=32A004978
- Number of n-step polygons on Kagome lattice.at n=9A005397
- Number of partitions of 3n into powers of 3.at n=47A005704
- Number of entries in first n rows of Pascal's triangle not divisible by 3.at n=76A006048
- Numbers n such that n! has a square number of digits.at n=26A006488
- Numbers whose sum of divisors is a square.at n=48A006532