1361
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1362
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1360
- Möbius Function
- -1
- Radical
- 1361
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 52
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 218
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).at n=9A000101
- Smallest nonnegative number that is the sum of 3 squares in exactly n ways.at n=15A000437
- Smallest number that is the sum of 3 squares in at least n ways.at n=15A000451
- a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.at n=24A001213
- Indices of prime Lucas numbers.at n=27A001606
- Smallest prime p such that there is a gap of 2n between p and previous prime.at n=16A001632
- Number of compositions of n into a sum of odd primes.at n=34A002124
- a(n) = 1000*log_10(n) rounded down.at n=22A004225
- Class 4+ primes (for definition see A005105).at n=21A005108
- Record values in A005210.at n=40A005211
- Partial sums of squares of Lucas numbers.at n=6A005970
- Inverse Moebius transform of triangular numbers.at n=45A007437
- Primes of form 8n+1, that is, primes congruent to 1 mod 8.at n=50A007519
- Coordination sequence T3 for Zeolite Code DDR.at n=23A008073
- Expansion of (1+x^11)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=46A008772
- Coordination sequence T3 for Zeolite Code DFO.at n=28A009877
- Coefficients in expansion of sqrt(2) as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=36A011193
- Coefficients in expansion of sqrt(2) as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=39A011193
- Next prime after n^3.at n=11A014220
- Cycle class sequence c(n) (number of true cycles of length n in which a certain node is included) for zeolite NON = Nonasil-[ 4158 ] [Si88O176].4R starting with a T1 atom.at n=10A019209