10736
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 23064
- Proper Divisor Sum (Aliquot Sum)
- 12328
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 1342
- Omega Function (Ω)
- 6
- 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
- 99
- Smith Number
- yes
- 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
- Number of points on surface of 4-dimensional cube.at n=11A008511
- a(n) = n*(21*n-1)/2.at n=32A022278
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).at n=32A051943
- Numbers n such that n and 2^n end with the same three digits.at n=10A067866
- Number of compositions of n where the smallest part is greater than or equal to the number of parts.at n=42A098131
- a(n) = 16*(8*prime(n) + 7).at n=22A098823
- Structured pentakis dodecahedral numbers (vertex structure 6).at n=10A100173
- The self-COMPOSE transform of A107097 and also the partial sums of A107097: g.f. A(x) = G(G(x)) = G(x)/(1-x) where G(x) is the g.f. of A107097.at n=10A107098
- Numbers k such that k concatenated with k+4 gives the product of two numbers which differ by 8.at n=2A116189
- Sequence of which A078783 is the Recamán transform.at n=39A117073
- Number at end of segment n of A117073.at n=12A117075
- a(n) = 5^n - 4^n - 3^n - 2^n.at n=6A137787
- a(n) = (prime(n)^5 - prime(n))/15.at n=4A138429
- Generalized Pell numbers P(n,5,5).at n=11A141448
- G.f.: A(x) = F(x*G(x))^2 where F(x) = G(x*F(x)) = 1 + x*F(x)^3 is the g.f. of A001764 and G(x) = F(x/G(x)) = 1 + x*G(x)^2 is the g.f. of A000108 (Catalan).at n=6A153390
- a(n) = n*(n^2+4).at n=22A155965
- a(n) = 512*n - 16.at n=20A157447
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k odd entries (0<=k<=n) A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=52A181295
- Numbers n having at least two distinct symmetrical pairs of divisors (a, b) and (b', a') such that n = a*b = b'*a' with a' = reverse(a) and b' = reverse(b).at n=22A228164
- Number of binary words of length n with exactly one occurrence of subword 010 and exactly two occurrences of subword 101.at n=17A260505