10734
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21480
- Proper Divisor Sum (Aliquot Sum)
- 10746
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3576
- Möbius Function
- -1
- Radical
- 10734
- 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
- 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
- Low temperature antiferromagnetic susceptibility for cubic lattice.at n=10A007217
- Fibonacci sequence beginning 4, 26.at n=14A022386
- Numbers which are the sum of their proper divisors containing the digit 7.at n=9A059466
- Number of partitions of primes into mutual coprimes > 1.at n=32A086191
- Number of partitions of n such that the set of parts has an even number of elements.at n=37A092306
- Numbers n such that 5*10^n + 7*R_n - 6 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=14A103019
- a(n) = Sum {k + j*m <= n} (k + j*m), with 0 < k,j,m <= n.at n=22A106847
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=29A112660
- Sequence of which A078783 is the Recamán transform.at n=37A117073
- Number at start of segment n of A117073.at n=12A117074
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=32A153747
- Numerators of fractions with the same position in A020652/A038567 and A182972/A182973.at n=14A182975
- Record (maximal) gaps between prime triples (p, p+2, p+6).at n=28A201598
- Floor of the expected value of number of trials until exactly three cells are empty in a random distribution of n balls in n cells.at n=21A210114
- a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 6.at n=14A214828
- Number of 0..n arrays of length 6 with each element differing from at least one neighbor by 1 or less, starting with 0.at n=22A221685
- Number of nX7 0..3 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=2A231107
- T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=38A231108
- Number of 3Xn 0..3 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=6A231109
- G.f. satisfies: A(x) = (1+x+x^2) * A(x^2)^2.at n=30A237651