10083
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13448
- Proper Divisor Sum (Aliquot Sum)
- 3365
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 1
- Radical
- 10083
- 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
- 42
- 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
- Smallest side lengths of almost-equilateral Heronian triangles (sides are consecutive positive integers, area is a nonnegative integer).at n=7A016064
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence).at n=34A024685
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=37A024844
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 99.at n=24A031597
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) = cn(3,5)).at n=50A036815
- Numerators of continued fraction convergents to sqrt(945).at n=5A042828
- Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.at n=32A050797
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=39A053719
- a(n) = A077727(n)/n.at n=35A077728
- Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 8 and (k+9) mod 11 <> 1.at n=3A096026
- Least number that requires exactly n iterations of f(x) = reverse(x) - maxdigit(x) to reach zero.at n=22A097156
- Numbers n such that the sum of the digits of n^phi(n) is divisible by n.at n=22A109660
- Semiprimes of the form 2*n + 1, where n is a square.at n=31A111351
- a(1) = 7, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.at n=27A111475
- Least k such that the difference between consecutive semiprimes A065516(k) equals n, or 0 if no such k exists.at n=30A123375
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=9A148792
- Symmetrical triangular sequence of Fibonacci numbers (A000045): p(x,n) = Product[1 + Fibonacci[i]*x, {i, 0, n}] + x^n*Product[1 + Fibonacci[i]/x, {i, 0, n}].at n=31A154851
- Symmetrical triangular sequence of Fibonacci numbers (A000045): p(x,n) = Product[1 + Fibonacci[i]*x, {i, 0, n}] + x^n*Product[1 + Fibonacci[i]/x, {i, 0, n}].at n=32A154851
- Sequence obtained from Fibonacci numbers by taking the factorials of each digit and summing.at n=22A164955
- Numbers of the form x^2 + y^2 + z^2 = phi(x*y*z) + sigma(x*y*z).at n=21A173792