9160
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20700
- Proper Divisor Sum (Aliquot Sum)
- 11540
- 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
- 3648
- Möbius Function
- 0
- Radical
- 2290
- Omega Function (Ω)
- 5
- 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
- 153
- 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 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 47.at n=27A031545
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 11 (most significant digit on right).at n=6A061964
- Smallest member of triple of consecutive numbers each of which is the sum of two different nonzero squares.at n=41A064715
- Limits of the recursion b(i+1)=B_[i](b(i)), where b(1)=n and B_[k+1](j) = B_[k](j), if j <= k; B_[k+1](j) = B_[k](j) + k, if j < k and (j mod 2k) >= k; B_[k+1](j) = B_[k](j) - k, if j < k and (j mod 2k) < k. Set a(n)=0 if b tends to infinity.at n=58A065194
- Record entries in A065194.at n=7A065195
- a(n) = floor(surface area of a sphere with radius n).at n=26A066644
- Lesser of three consecutive nonsquare integers each of which is the sum of two squares.at n=41A073412
- 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=28A101243
- Indices of primes in sequence defined by A(0) = 17, A(n) = 10*A(n-1) - 3 for n > 0.at n=24A102024
- Smaller side not divisible by 37 of right triangles with integer sides and integer side inscribed squares with two vertices on the hypotenuse.at n=10A123697
- Triangle read by rows: T(n,k) = number of endofunctions on a set with n elements, where the maximum indegree is k.at n=57A127119
- a(n) = 8 - 12*n + 5*n^2.at n=43A145995
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=7A150574
- G.f.: exp( Sum_{n>=1} A174478(n)*x^n/n ) where A174478(n) = Sum_{d|n} d*2^(n/d)*tau(d).at n=10A174477
- Expansion of 2*x^2 *(4 +7*x +5*x^2 -x^3 -4*x^4 +6*x^6 +4*x^7 -x^8 -2*x^9) / ((1+x)^2 *(1+x+x^2)^2 *(1-x)^4) .at n=37A187062
- G.f.: A(x) = exp( Sum_{n>=1} 5*5^A112765(n) * x^n/n ), where A112765 is the exponent of the highest power of 5 dividing n.at n=15A195760
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n.at n=20A211140
- a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.at n=27A214963
- Numbers k such that 23*k+1 is a square.at n=39A219393
- Volume of elliptic cone (rounded down) with semi-minor axis = height = n and semi-major axis = 3*n/2.at n=17A228391