10370
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20088
- Proper Divisor Sum (Aliquot Sum)
- 9718
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 1
- Radical
- 10370
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 42
- 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
- yes
- Odd
- no
Appears in sequences
- Numerators of continued fraction convergents to cube root of 7.at n=7A005484
- a(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).at n=16A006490
- Coordination sequence for body-centered tetragonal lattice.at n=36A008527
- a(0) = 1, a(n) = 18*n^2 + 2 for n>0.at n=24A010008
- a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=18A010021
- Fibonacci sequence beginning 0, 17.at n=15A022351
- Numbers whose base-4 representation contains exactly three 0's and four 2's.at n=13A045056
- Length of hypotenuse squared in right triangle formed by a prime spiral plotted in Cartesian coordinates.at n=20A048851
- Hypotenuses of special Pythagorean triples constructed from twin primes as follows: {u, w}={p,p+2}; side a=2p(p+2), side b=(p+2)^2-p^2 and the terms of sequence are values of c=a(n)=p^2+(p+2)^2=phi(a/2)+1+sigma(a/2)+1.at n=7A063533
- a(n) = prime(n+1)^2 + prime(n)^2.at n=19A069484
- Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).at n=61A071943
- Smallest number having exactly n representations as sum of two squares of distinct primes.at n=4A088919
- Bisection of A001157: sigma_2(2n).at n=43A099979
- Triangle read by rows: T(n,k) = binomial(2n+1, n-k)*Fibonacci(2k+1), 0 <= k <= n.at n=43A103245
- Divide each Fibonacci number by its primitive part.at n=44A105602
- a(n) = (2*n-1)^2 + (2*n+1)^2.at n=36A108100
- a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=44A111079
- Row sums of triangle A117401: a(n) = Sum_{k=0..n} 2^((n-k)*k) for n>=0.at n=7A117402
- A106486-encodings of combinatorial games with value -1.at n=26A125993
- Composite numbers that are products of distinct primes and divisible by the sum of those primes.at n=32A131647