1104
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 2976
- Proper Divisor Sum (Aliquot Sum)
- 1872
- 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
- 352
- Möbius Function
- 0
- Radical
- 138
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 18
- 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 cusps of principal congruence subgroup Gamma^{hat}(n).at n=45A000114
- Number of ways of writing n as a sum of 24 squares.at n=2A000156
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=16A000297
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=44A000695
- Number of compositions of n into 3 ordered relatively prime parts.at n=50A000741
- a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.at n=50A000916
- Smallest natural number requiring n letters in English.at n=25A001166
- a(n) = 2*a(n-1)*(a(n-1)-1) for n > 1, with a(0) = 1, a(1) = 2.at n=4A001510
- Squares written in base 6.at n=16A001741
- Expansion of (Sum_{n=-inf..inf} x^(n^2))^(-23).at n=2A004424
- Powers of 2 written in base 6.at n=8A004645
- a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.at n=38A004962
- Generalized Fibonacci numbers D_{n,3}.at n=12A006211
- Number of rooted planar maps with 3 vertices and n faces and no isthmuses.at n=3A006420
- Numbers k such that k*(k+1)/2 + 1 is a square.at n=8A006451
- Primitive repfigit numbers.at n=7A006576
- Numbers k such that sigma(x) = k has exactly 3 solutions.at n=28A007372
- a(n) = phi(n) * (sigma(n) - n).at n=51A007517
- a(n) = floor(n^2/2).at n=47A007590
- Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers).at n=8A007629