1382
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
- 4
- Divisor Sum
- 2076
- Proper Divisor Sum (Aliquot Sum)
- 694
- 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
- 690
- Möbius Function
- 1
- Radical
- 1382
- 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
- 127
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=25A001208
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with initial conditions a(0..3) = (0, 0, 1, 0).at n=15A001631
- Number of partitions of n into nonprime parts.at n=42A002095
- G.f.: q * Product_{m>=1} (1-q^m)^8*(1-q^2m)^8.at n=13A002288
- Numerators in Taylor series for tan(x). Also from Taylor series for tanh(x).at n=5A002430
- Numerator in Feinler's formula for unsigned Bernoulli number |B_{2n}|.at n=6A002443
- Number of integers with a shortest addition chain of length n.at n=14A003065
- Coefficients of modular function denoted G_6(tau) by Atkin.at n=9A005764
- Coordination sequence T4 for Zeolite Code EUO.at n=23A008099
- Coordination sequence T3 for Zeolite Code FER.at n=23A008108
- Coordination sequence T3 for Zeolite Code LOV.at n=25A008136
- Molien series for A_7.at n=28A008630
- If a, b in sequence, so is a*b+2.at n=47A009299
- Coordination sequence T3 for Zeolite Code ZON.at n=26A009921
- Number of ordered triples of integers from [ 2,n ] with no global factor.at n=20A015633
- Sum of n-th Lucas number greater than 3 and n-th number that is 1 or is not a Fibonacci number.at n=12A023489
- Coordination sequence T1 for Zeolite Code IFR.at n=26A024982
- a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=17A025017
- Numbers that are the sum of 3 nonzero squares in exactly 10 ways.at n=27A025330
- Numbers that are the sum of 3 distinct nonzero squares in exactly 9 ways.at n=18A025347