10738
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 9422
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4176
- Möbius Function
- 1
- Radical
- 10738
- 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
- 73
- 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
- Spiral sieve using Fibonacci numbers.at n=19A005621
- Expansion of e.g.f. sec(sin(x)*exp(x))=1+1/2!*x^2+6/3!*x^3+25/4!*x^4+140/5!*x^5...at n=7A012293
- Number of partitions satisfying cn(1,5) + cn(4,5) < cn(0,5) + cn(2,5) + cn(3,5).at n=37A039868
- Number of partitions satisfying cn(0,5) + cn(1,5) <= cn(2,5) + cn(3,5) and cn(0,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=37A039886
- a(n) = 3^n + 8^n + 9^n.at n=4A074560
- Indices of primes in sequence defined by A(0) = 31, A(n) = 10*A(n-1) + 51 for n > 0.at n=16A101839
- Triangular T(n,k) which contains in column k >= 0 the elements of the Stirling transform of the unsigned sequence Stirling1(j+k,j), j >= 0.at n=25A118984
- Number of ways to place zero or more nonadjacent 1,1 2,0 2,1 3,2 3,3 4,4 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155305
- a(n) = 3*a(n-1) - 2*a(n-2) with a(0)=28 and a(1)=70.at n=8A182465
- Sequence related to Kashaev's invariant for the (9,2)-torus knot.at n=5A208735
- Number of partitions p of n such that max(p)-min(p) = 6.at n=43A218569
- The number of permutations p of {1,...,n} such that p(1)=1, p(n)=n, and |p(i)-p(i+1)| is in {1,2,3} for all i from 1 to n-1.at n=14A249665
- Number of length n+2 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=37A255993
- If n is 0, 1, or prime, a(n) = n; else a(n) = a(n-1) + a(n-2).at n=36A265822
- Consider a number x > 1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the Euler totient function of x.at n=18A269310
- Numbers n such that (2^n + 1) / gcd(n, 2^n + 1) is not squarefree.at n=29A272361
- Coefficients in the expansion of ([s] + [2s]x + [3s]x^2 + ...)/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = e - 1, s = r/(1-r).at n=27A279632
- Number of nX5 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=6A281712
- T(n,k)=Number of nXk 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=61A281715
- Number of 7Xn 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=4A281721