1351
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1552
- Proper Divisor Sum (Aliquot Sum)
- 201
- 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
- 1152
- Möbius Function
- 1
- Radical
- 1351
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 158
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=20A000125
- Restricted permutations.at n=9A000382
- a(0) = 1, a(1) = 2, a(n) = 4*a(n-1) - a(n-2).at n=6A001075
- Hit polynomials.at n=4A001890
- a(2*n) = a(2*n-1) + a(2*n-2), a(2*n+1) = 2*a(2*n) + a(2*n-1); a(0) = a(1) = 1.at n=12A002531
- E.g.f. 1 + x*exp(x) + x^2*exp(2*x).at n=7A003013
- From a nim-like game.at n=26A003413
- a(n) = (1 + a(n-1)*a(n-2))/a(n-3), a(0) = a(1) = a(2) = 1.at n=13A005246
- From fundamental unit of Z[ (-d)^{1/4} ], where d runs over positive integers not of the form 4*k^4.at n=34A006828
- Number of partitions of n into partition numbers.at n=36A007279
- Coordination sequence T1 for Zeolite Code STI.at n=25A008234
- Numbers k such that any group of k consecutive integers has integral standard deviation (viz. A011944(k)).at n=3A011943
- Expansion of e.g.f. tan(log(x+1) - sin(x)).at n=7A013212
- E.g.f.: arctanh(log(x+1)-sin(x)) = -1/2!*x^2 + 3/3!*x^3 - 6/4!*x^4 + 23/5!*x^5 + ...at n=7A013218
- Numbers that are not the sum of a square and a prime.at n=31A014090
- a(n) = n^2 - floor( n/2 ).at n=37A014848
- Positive integers n such that 2^n == 2^7 (mod n).at n=41A015927
- Number of monotone Boolean functions of n variables with 2 mincuts. Also number of Sperner systems with 2 blocks.at n=4A016269
- Expansion of 1/(1-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=52A017872
- Expansion of 1/(1-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18-x^19-x^20).at n=58A017896