10483
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11448
- Proper Divisor Sum (Aliquot Sum)
- 965
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9520
- Möbius Function
- 1
- Radical
- 10483
- 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
- 86
- 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
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=65A011907
- Catacondensed simply-connected monopentapolyhexes.at n=8A024311
- Numerators of continued fraction convergents to sqrt(997).at n=8A042930
- Surround numbers of an n X 1 rectangle.at n=9A060633
- Numbers k such that prime(k) + prime(k+1) is a square.at n=31A064397
- a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.at n=44A068573
- Number of base 7 n-digit numbers with adjacent digits differing by four or less.at n=5A126502
- a(n) = Fibonacci(n) mod n^3.at n=27A132636
- Numbers k such that prime(k) + prime(k+1) is a perfect power.at n=37A132746
- a(n) = Frobenius number for 4 successive primes = F[p(n), p(n+1), p(n+2), p(n+3)].at n=47A138990
- a(n) = A168174(n)-10^12.at n=13A168248
- Number of 6-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first differences in -n..n.at n=7A209034
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210858; see the Formula section.at n=41A210859
- Semiprimes which have one or more occurrences of exactly five different digits.at n=24A235693
- Number of palindromic partitions of n whose greatest part has multiplicity <= 3.at n=51A238786
- Five-digit odd semiprimes with all digits distinct.at n=17A247948
- Number of nX6 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2.at n=2A275226
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2.at n=30A275228
- Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2.at n=5A275229
- Numbers x = concat(a,b) such that b and a are the first two terms for a Fibonacci-like sequence containing x itself.at n=43A307863