10594
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
- 15894
- Proper Divisor Sum (Aliquot Sum)
- 5300
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5296
- Möbius Function
- 1
- Radical
- 10594
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=70A011913
- (1/1 - 1/3 + 1/6 + ... + d/C(n+1,2))*LCM{1,3,6,...,C(n+1,2)}, where d = (-1)^n.at n=9A025559
- a(n) = T(2n,n-1), where T is the array defined in A024996.at n=6A026076
- Number of partitions of n into parts 3k and 3k+1 with at least one part of each type.at n=48A035618
- Numerators of continued fraction convergents to sqrt(184).at n=9A041340
- Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.at n=24A061153
- a(n) is the sum of the n-th row of the triangle formed by replacing each m in Pascal's triangle with sigma(m).at n=12A074801
- Indices of primes which remain prime if any one digit is deleted (leading zeros allowed).at n=45A084375
- G.f. A(x) satisfies: A(x) = 1/(1-2*x) + x^2*A(x)^2.at n=10A086622
- Number of n X 2 0..5 arrays with every 2 X 2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.at n=4A209738
- Number of nX5 0..5 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.at n=1A209741
- T(n,k)=Number of nXk 0..5 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.at n=16A209744
- T(n,k)=Number of nXk 0..5 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.at n=19A209744
- Number of length n+4 0..5 arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=13A249653
- Numbers k such that (14*10^k - 71) / 3 is prime.at n=23A279467
- a(n) is the least k such that gcd(A006666(k), A006667(k)) = n.at n=32A281938
- Number of nX7 0..1 arrays with every element equal to 1, 2, 4 or 7 king-move adjacent elements, with upper left element zero.at n=16A298092
- Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 9, up to isomorphism.at n=32A358249
- For any number k >= 0, let T_k be the triangle with values in {-1, 0, +1} whose base corresponds to the balanced ternary expansion of k (without leading zeros) and other values, say t above u and v, satisfy t+u+v = 0 mod 3; this sequence lists the numbers k such that T_k has 3-fold rotational symmetry.at n=41A371636
- Number of integer partitions of n having more than one permutation with all equal run-lengths.at n=35A383090