1274
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2394
- Proper Divisor Sum (Aliquot Sum)
- 1120
- 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
- 504
- Möbius Function
- 0
- Radical
- 182
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 57
- 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
- a(n) = n*(n+3)/2.at n=49A000096
- Number of 3-line partitions of n.at n=13A000991
- Number of cells of square lattice of edge 1/n inside quadrant of unit circle centered at 0.at n=40A001182
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).at n=38A001304
- Related to Latin rectangles.at n=3A001624
- Numbers m such that 3*2^m - 1 is prime.at n=26A002235
- Numbers that are the sum of 9 positive 5th powers.at n=50A003354
- Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 with 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum a(P(n)), n>0.at n=52A004065
- Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 with 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum a(P(n)), n>0.at n=56A004065
- Convolution of A002024 with itself.at n=39A004797
- Numbers k such that k, k+1 and k+2 have the same number of divisors.at n=24A005238
- Number of permutations of [n] with four inversions.at n=9A005287
- 1 + (sum of first n odd primes - n)/2.at n=36A005521
- Least k such that binomial(k,n) has n or more distinct prime factors.at n=35A005733
- Least k such that binomial(k,n) has n or more distinct prime factors.at n=34A005733
- Weighted count of partitions with odd parts.at n=29A005896
- a(n) = n*(n+1)^2/2.at n=13A006002
- Numbers k such that sigma(x) = k has exactly 3 solutions.at n=34A007372
- Even minus odd extensions of truncated 3 X 2n grid diagram.at n=3A007724
- Expansion of (x^6-x^5-x^4+2x^2)/((1-x^3)(1-x^2)^2(1-x)).at n=40A007988