10955
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15072
- Proper Divisor Sum (Aliquot Sum)
- 4117
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- -1
- Radical
- 10955
- 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
- 161
- 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
- a(n) = n*(9*n-2).at n=35A013656
- "Ceiling of hypotenuses": a(n) = ceiling(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=34A104805
- Numbers k such that k^6+6 is prime.at n=41A109836
- 3-almost primes that are the sum of 2 positive cubes. Sums of 2 positive cubes, with the sums having exactly 3 prime divisors counted with multiplicity.at n=36A122732
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 5 and 9.at n=56A136826
- 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, -1, 0), (-1, 0, 1), (0, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=8A149958
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 9 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=36A166059
- a(n) = Fibonacci(n + 2) + floor(n/2).at n=19A167270
- Triangle T(n, k, q) = binomial(n, k) + q^n*binomial(n-2, k-1) - 1 with T(n, 0) = T(n, n) = 1 and q = 3, read by rows.at n=30A173047
- Triangle T(n, k, q) = binomial(n, k) + q^n*binomial(n-2, k-1) - 1 with T(n, 0) = T(n, n) = 1 and q = 3, read by rows.at n=33A173047
- Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=10.at n=19A185649
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210867; see the Formula section.at n=49A210866
- Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant = 1 (mod 3).at n=13A211034
- A213784/12.at n=21A213789
- Integers n such that both 2*n^2 + 3*(n+2)^2 and 3*n^2 + 2*(n+2)^2 are prime.at n=40A216849
- Number of n X 3 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=19A281710
- a(1) = 0; and for n > 1, a(n) = 2*a(A285712(n)) + [0 == (n mod 3)].at n=26A292590
- Base-2 expansion of a(n) encodes the steps where numbers of the form 6k+5 are encountered when map x -> A252463(x) is iterated down to 1, starting from x=n.at n=52A292945
- Partial sums of A299274.at n=25A299275
- Number of permutations w in S_n that form Boolean intervals [s, w] in the Bruhat order for every simple reflection s in the support of w.at n=10A331347