1085
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1536
- Proper Divisor Sum (Aliquot Sum)
- 451
- 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
- 720
- Möbius Function
- -1
- Radical
- 1085
- 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
- 44
- 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
- no
- Odd
- yes
Appears in sequences
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=14A000323
- Number of discordant permutations.at n=2A000563
- Landau's approximation to population of x^2 + y^2 <= 2^n.at n=12A000690
- Number of sublattices of index n in generic 3-dimensional lattice.at n=19A001001
- A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n.at n=37A001149
- a(n) = (6*n+1)*(6*n+5).at n=5A001513
- The coding-theoretic function A(n,4,4).at n=27A001843
- Generalized sum of divisors function.at n=29A002130
- Odd squarefree numbers with an odd number of prime factors that have no prime factors greater than 31.at n=45A002556
- Sum of logarithmic numbers.at n=5A002743
- Number of period-n solutions to a certain "universal" equation related to transformations on the unit interval.at n=12A002823
- Number of points on surface of square pyramid: 3*n^2 + 2 (n>0).at n=19A005918
- Number of noncommutative SL(2,C)-invariants of degree n in 5 variables.at n=8A007043
- Coordination sequence T7 for Zeolite Code MTW.at n=22A008202
- 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=45A008345
- Expansion of (1+x^12)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=43A008773
- Expansion of e.g.f. sinh(log(1+x)*exp(x)).at n=7A009581
- Coordination sequence T2 for Zeolite Code VET.at n=20A009903
- Weight distribution of d=3 Hamming code of length 31.at n=27A010086
- Weight distribution of d=3 Hamming code of length 31.at n=4A010086