1362
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2736
- Proper Divisor Sum (Aliquot Sum)
- 1374
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 452
- Möbius Function
- -1
- Radical
- 1362
- 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
- 65
- 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
- yes
- Odd
- no
Appears in sequences
- Number of different shapes formed by bending a piece of wire of length n in the plane.at n=9A001997
- Integer part of 24(2^n-1)/n.at n=8A003176
- a(n) = 1000*log_10(n) rounded to the nearest integer.at n=22A004226
- a(n) = ceiling(1000*log_10(n)).at n=22A004227
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=29A004923
- a(n) = round(n*phi^8), where phi is the golden ratio, A001622.at n=29A004943
- a(n) = Sum_t t*F(n,t), where F(n,t) is the number of forests with n (unlabeled) nodes and exactly t trees, all of which are planted (that is, rooted trees in which the root has degree 1).at n=10A005199
- Number of convex polygons of length 2n on square lattice whose leftmost bottom vertex and rightmost top vertex have the same x-coordinate.at n=4A005770
- Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=14A007039
- Number of 3rd-order maximal independent sets in cycle graph.at n=33A007387
- Coordination sequence T1 for Zeolite Code MER.at n=27A008160
- Coordination sequence T7 for Zeolite Code MFS.at n=23A008179
- Coordination sequence T5 for Zeolite Code PAU.at n=27A008223
- Coordination sequence T6 for Zeolite Code PAU.at n=27A008224
- Coordination sequence T4 for Zeolite Code STI.at n=25A008237
- Coordination sequence T5 for Zeolite Code RSN.at n=24A009889
- Expansion of (1+x^2)/(1-2*x+x^3).at n=13A014739
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among triples.at n=11A015656
- Numbers k such that phi(k) | sigma_14(k).at n=13A015773
- Numbers k such that the continued fraction for sqrt(k) has period 18.at n=40A020357