1341
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1950
- Proper Divisor Sum (Aliquot Sum)
- 609
- 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
- 888
- Möbius Function
- 0
- Radical
- 447
- Omega Function (Ω)
- 3
- 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
- 70
- 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
- no
- Odd
- yes
Appears in sequences
- Triangular numbers written backwards.at n=53A004158
- a(n) = Fibonacci(n+1) - 2^floor(n/2).at n=16A005672
- Coordination sequence T2 for Zeolite Code DFO.at n=28A009876
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=59A015931
- Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).at n=17A019298
- Pseudoprimes to base 44.at n=17A020172
- Numbers k such that the continued fraction for sqrt(k) has period 48.at n=3A020387
- a(n) = floor((4th elementary symmetric function of S(n))/(3rd elementary symmetric function of S(n))), where S(n) = {first n+3 positive integers congruent to 1 mod 3}.at n=58A024224
- Coordination sequence T4 for Zeolite Code MWW.at n=24A024989
- Numbers that are the sum of 3 nonzero squares in exactly 10 ways.at n=25A025330
- Numbers that are the sum of 3 nonzero squares in 10 or more ways.at n=44A025338
- Numbers that are the sum of 3 distinct nonzero squares in exactly 10 ways.at n=25A025348
- Numbers that are the sum of 3 distinct nonzero squares in 10 or more ways.at n=35A025356
- a(n) = (Sum_{i=0..n-1} 1/b(i)) * LCM{b(i): i=0..n-1}, where b(i) = C(i,floor(i/2)).at n=8A025553
- a(n) = sum of the numbers between the two n's in A026354.at n=33A026357
- a(n) = n^2 + n + 9.at n=36A027694
- a(n) = Fibonacci(n) - 2^(floor(n/2)).at n=17A028892
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 24 ones.at n=3A031792
- Exactly 4 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=44A032700
- Multiplicity of highest weight (or singular) vectors associated with character chi_30 of Monster module.at n=31A034418