2305
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2772
- Proper Divisor Sum (Aliquot Sum)
- 467
- 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
- 1840
- Möbius Function
- 1
- Radical
- 2305
- 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
- 107
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers m such that Fibonacci(m) ends with m.at n=44A000350
- Number of compositions of n into 5 ordered relatively prime parts.at n=13A000743
- a(n) = n^2 + 1.at n=48A002522
- Sum of 10 nonzero 8th powers.at n=9A003388
- a(n) = n*2^(n-1) + 1.at n=9A005183
- Numbers k such that k, k+1 and k+2 have the same number of divisors.at n=45A005238
- Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.at n=38A007664
- Coordination sequence T3 for Zeolite Code FER.at n=29A008108
- exp(arctanh(x)*exp(x))=1+x+3/2!*x^2+12/3!*x^3+57/4!*x^4+340/5!*x^5...at n=6A012709
- Quadruples of different integers from [ 1,n ] with no global factor.at n=16A015622
- Pseudoprimes to base 48.at n=20A020176
- Strong pseudoprimes to base 48.at n=8A020274
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=18A022905
- a(n) = least m such that if r and s in {1/4, 1/8, 1/12,..., 1/4n} satisfy r < s, then r < k/m < s for some integer k.at n=27A024825
- Least m such that if r and s in {Pi/2 - atn(h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k.at n=53A024832
- Numbers that are the sum of 4 distinct positive cubes in exactly 2 ways.at n=30A025409
- Numbers that are the sum of 4 distinct positive cubes in 2 or more ways.at n=32A025412
- a(n) = (1/C(n,0) - 1/C(n,1) + ... + d/C(n,k))*L, where d = (-1)^k,k = [ n/2 ], L = LCM{C(n,0), C(n,1),..., C(n,n)}.at n=10A025536
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 96.at n=0A031774
- Fractional part of square root of n starts with 0: first term of runs (squares excluded).at n=43A034106