10747
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
- 4
- Divisor Sum
- 11736
- Proper Divisor Sum (Aliquot Sum)
- 989
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9760
- Möbius Function
- 1
- Radical
- 10747
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 99
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Fibonacci sequence beginning 1, 17.at n=15A022107
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 17 (most significant digit on right).at n=12A029510
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=33A031899
- "BGK" (reversible, element, unlabeled) transform of 0,1,1,1,...at n=34A032060
- a(n) = (Sum{k=0..n-1} a(k)) - a(n-3), with a(0)=0, a(1)=0, a(2)=1.at n=18A049856
- Numbers k such that (34*10^(k-1) - 43)/9 is a plateau prime.at n=11A082708
- a(n) = n*F(n-1) + F(n), where F = A000045.at n=16A094588
- A Chebyshev transform of A057083.at n=16A099446
- a(n) = 9*n^2 - 8*n + 2.at n=35A154254
- Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth exactly g.at n=13A184940
- Number of connected 4-regular simple graphs on n vertices with girth exactly 3.at n=13A184943
- Triangular array C(n,r) = number of connected r-regular graphs, having girth exactly 3, with n nodes, for 0 <= r < n.at n=82A186733
- Triangular array read by rows: T(n,k) is the number of compositions of n that have exactly k 3's; n>=0, 0<=k<=floor(n/3).at n=51A218796
- a(n)=sum_{j=0..n} sum_{i=0..j} F(i)*L(j), where F(n)=A000045(n) and L(n)=A000032(n).at n=9A242496
- Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=15A252378
- Number of (n+3)X(4+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=4A262239
- T(n,k) = Number of (n+3) X (k+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=31A262240
- T(n,k) = Number of (n+3) X (k+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=32A262240
- Number of (n+2)X(2+2) 0..2 arrays with each row and column divisible by 13, read as a base-3 number with top and left being the most significant digits.at n=5A263335
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each row and column divisible by 13, read as a base-3 number with top and left being the most significant digits.at n=22A263337