10293
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
- 14208
- Proper Divisor Sum (Aliquot Sum)
- 3915
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6624
- Möbius Function
- -1
- Radical
- 10293
- 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
- 29
- 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
- no
- Odd
- yes
Appears in sequences
- Numerators of expansion of Jacobi nome q in parameter m.at n=6A002639
- a(2n) = concatenation of 4n+1 and 4n+2, a(2n+1) = concatenation of the two most nearly equal numbers whose product is a(2n).at n=15A068517
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=20A075605
- a(1) = 7 then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=43A083994
- a(n) = 2*a(n-1) + a(n-2) + a(n-3) + a(n-4), with a(0)=1, a(1)=2, a(3)=5, a(4)=13.at n=10A103142
- Composite Fibonacci sequence: each term is the composite with index equal to the sum of the previous two terms.at n=12A107390
- Numbers k such that k^2 is a square arising in A154138.at n=10A156066
- Number of nX5 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=5A166789
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=19A208181
- Numbers n such that n^2-9 is divisible by consecutive primes beginning with 2.at n=24A217277
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k^2)).at n=34A280276
- Numbers n such that there are precisely 2 groups of orders n, n + 1 and n + 2.at n=40A296022
- a(n) = Sum_{k=0..2*n/3} C(n-k,2*k-n)^2.at n=21A298567
- Number of perfect matchings on a triangular lattice of width 4 and length n.at n=8A309117
- Numbers that are the sum of nine fourth powers in eight or more ways.at n=25A345592
- Numbers that are the sum of nine fourth powers in exactly eight ways.at n=22A345850
- Number of partial order-preserving or -reversing transformations of a chain of length n.at n=5A371698