9260
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19488
- Proper Divisor Sum (Aliquot Sum)
- 10228
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3696
- Möbius Function
- 0
- Radical
- 4630
- Omega Function (Ω)
- 4
- 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
- 109
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 8 positive 7th powers.at n=34A003375
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 48.at n=39A031546
- Gaps of 7 in sequence A038593 (upper terms).at n=27A038654
- Numbers that are divisible by 5 and are the difference between two (different positive) cubes in at least one way.at n=40A038853
- Numbers that are divisible by 10 and are differences between two cubes in at least one way.at n=12A038854
- a(n) = a(n-1) + the number of primes <= a(n-1).at n=40A061535
- Integers n >= 1 such that n divides 0!-1!+2!-3!+4!-...+(-1)^{n-1}(n-1)!.at n=29A064383
- Integers k such that prime(k)-1 == 0 (mod phi(k)) where prime(n)=A000040(n) is the n-th prime and phi(n)=A000010(n) is the Euler totient function.at n=50A066936
- a(n) = n^3 - 1.at n=20A068601
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 43 for n > 0.at n=6A101077
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=38A101243
- Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=23A108914
- n^3 - 1 divided by its largest cube divisor.at n=19A128972
- Positive X-values of solutions to the equation 1!*X^4 - 2!*(X + 1)^3 + 3!*(X + 2)^2 - (4^2)*(X + 3) + 5^2 = Y^3.at n=20A135300
- Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=14A141029
- a(n) = 250*n + 10.at n=36A154379
- a(n) = 441*n - 1.at n=20A158319
- Number of binary strings of length n with no substrings equal to 0001 0101 or 1010.at n=13A164472
- Fibonacci sequence beginning 10, 9.at n=15A184959
- Number of n X 3 0..3 arrays with rows and columns lexicographically nondecreasing read forwards and nonincreasing read backwards.at n=3A201976