10760
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24300
- Proper Divisor Sum (Aliquot Sum)
- 13540
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4288
- Möbius Function
- 0
- Radical
- 2690
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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 51.at n=36A031549
- Numbers whose base-4 representation contains exactly three 0's and four 2's.at n=17A045056
- a(n) = (4*n^2 + 2*n - 3)*(2*n - 1)*n/3.at n=8A058581
- Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k).at n=17A063969
- Triangle T(n,k), 0<= k <= n, read by rows; given by [0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] DELTA [1, 0, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, ...] where DELTA is the operator defined in A084938.at n=32A094344
- Number of fib100 primes (A095088) in range ]2^n,2^(n+1)].at n=19A095068
- G.f.: (1+x^2)^2*(x^4-6*x^3+1)/(x^2-1)^4.at n=40A115046
- Numbers k such that k and k^2 use only the digits 0, 1, 5, 6 and 7.at n=11A136869
- a(1)=1. a(n) = A005179(d(a(n-1))) + a(n-1), where d(n) = the number of divisors of n, and A005179(n) is the smallest positive integer with exactly n divisors.at n=42A175300
- Number of obtuse triangles on an n X n grid (or geoboard).at n=6A190020
- Numbers k such that 27*k+1 is a square.at n=39A219258
- Expansion of (1-3*x+x^2)*(1-2*x)/(1-9*x+28*x^2-35*x^3+15*x^4-x^5).at n=7A221859
- a(n) = n*prime(prime(n)) - prime(n)^2.at n=38A230098
- a(n) = n*(n + 1)*(19*n - 16)/6.at n=15A237618
- Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of parts > 1) is not a part.at n=40A241514
- Numbers k such that 41*10^k - 1 is prime.at n=17A294920
- Number of nX4 0..1 arrays with every element equal to 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=12A298051
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having degree of asymmetry k (n >= 1, 0 <= k <= n-1).at n=63A298645
- a(n) = 2*a(n-1) + 6*a(n-2) for n >= 2, a(0) = 1, a(1) = 5.at n=7A307469
- G.f. A(x) satisfies: A(x) = A(x^2) / (1 - x - x^2 - x^3).at n=15A309702