1479
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2160
- Proper Divisor Sum (Aliquot Sum)
- 681
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 896
- Möbius Function
- -1
- Radical
- 1479
- 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
- 96
- 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
- Number of plane partitions (or planar partitions) of n.at n=12A000219
- Coefficients of ménage hit polynomials.at n=7A000222
- Number of paraffins C_n H_{2n} X Y with n carbon atoms.at n=9A000635
- Number of partitions of n into parts of 3 kinds.at n=9A000716
- Positions of remoteness 6 in Beans-Don't-Talk.at n=34A005694
- a(n) = a(n-1) + a(n-8), with a(i) = 1 for i = 0..7.at n=39A005710
- Coordination sequence T1 for Zeolite Code AFT.at n=29A008026
- Coordination sequence T2 for Zeolite Code AFT.at n=29A008027
- Coordination sequence T3 for Zeolite Code DDR.at n=24A008073
- Apply partial sum operator twice to binary rooted tree numbers.at n=11A014168
- a(n) = n^2 + 3*n - 1.at n=37A014209
- Sequence arising from analysis of Levine's sequence A011784: essentially a duplicate of A144005.at n=6A014623
- Expansion of 1/(1 - x^8 - x^9 - ...).at n=47A017902
- Pseudoprimes to base 86.at n=17A020214
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly seven 1's.at n=8A020443
- Numbers k such that k + sum of its prime factors = (k+1) + sum of its prime factors.at n=12A020700
- Fibonacci sequence beginning 1, 16.at n=11A022106
- Convolution of odd numbers and A014306.at n=41A023661
- Positions of nonprimes among the powers of primes (A000961).at n=55A024621
- a(n) is the position of square of n-th prime among the powers of primes (A000961).at n=28A024624