1083
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
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1524
- Proper Divisor Sum (Aliquot Sum)
- 441
- 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
- 684
- Möbius Function
- 0
- Radical
- 57
- Omega Function (Ω)
- 3
- 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
- 137
- 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
- no
- Odd
- yes
Appears in sequences
- Number of odd integers <= 2^n of form x^2 + y^2.at n=12A000074
- Number of partitions of n if there are two kinds of 1, two kinds of 2 and two kinds of 3.at n=13A000098
- Number of partitions of n into prime parts.at n=53A000607
- Number of protruded partitions of n with largest part at most 10.at n=10A005116
- Numbers k such that 10*3^k - 1 is prime.at n=32A005542
- Spiral sieve using Fibonacci numbers.at n=14A005622
- Coordination sequence T2 for Zeolite Code ATV.at n=21A008044
- Coordination sequence T3 for Zeolite Code PAU.at n=24A008221
- a(n+1) = a(n)-b(n+1) if a(n) >= b(n+1) else a(n)+b(n+1), where {b(n)} are the triangular numbers A000217.at n=49A008345
- Expansion of (1+x^7)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=41A008768
- Expansion of e.g.f. log(1+log(1+x)/exp(x)).at n=5A009324
- Triangle of multi-edge stars with n edges by cyclotomic index.at n=50A010358
- Coefficients in expansion of Pi as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=31A011191
- Expansion of (1+2*x+3*x^2)/((1-x)*(1-x^2)^2).at n=37A014255
- Numbers k that divide s(k), where s(1)=1, s(j)=7*s(j-1)+j.at n=20A014854
- Numbers k such that k divides s(k), where s(1)=1, s(j)= s(j-1) + j*7^(j-1).at n=12A014948
- Numbers k such that k | 8^k + 1.at n=10A015955
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=39A017853
- Number of elements in the set {(x,y): 1 <= x,y <= n, gcd(x,y)=1}.at n=41A018805
- (n-2)nd Catalan number is congruent to n/3 mod n.at n=45A019467