10063
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10440
- Proper Divisor Sum (Aliquot Sum)
- 377
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9688
- Möbius Function
- 1
- Radical
- 10063
- 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
- 117
- 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) = 6*a(n-1) + a(n-2) for n > 1, with a(0) = a(1) = 1.at n=6A015451
- Numbers k such that the continued fraction for sqrt(k) has period 84.at n=36A020423
- Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 4).at n=42A035542
- Number of partitions of n into distinct parts with 2 levels of parentheses.at n=15A050343
- Numbers n such that 289*2^n-1 is prime.at n=16A050903
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=12A064687
- Numbers k such that sigma(k) divides sigma(phi(k)).at n=35A066831
- Numbers n such that sigma(phi(n))/sigma(n) = 2.at n=24A067382
- Row sums of the triangle in A122820.at n=28A077388
- Numerators of convergents to 3/(1 + sqrt(10)).at n=16A093611
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+1 of T), or [T^p](m,0) = p*T(p+m,p+1) for all m>=1 and p>=-1.at n=29A104980
- Column 1 of triangle A104980; also equals column 0 of triangle A104986, which equals the matrix logarithm of A104980.at n=7A104981
- Matrix logarithm of triangle A104980.at n=28A104986
- Number of partitions of n with a product greater than n.at n=33A114324
- Semiprimes k=p*q such that the polynomial (1+x)^k (mod k) has p+q nonzero terms.at n=34A116926
- Triangular array read by rows: see Comments for definition.at n=20A121875
- Smallest sum of n consecutive odd primes which is a multiple of n.at n=28A132810
- 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, 0), (-1, 0, -1), (0, 1, 1), (1, -1, 0), (1, 1, 1)}.at n=7A150738
- 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, 0), (-1, 1, -1), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150739
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions 0 and {(m+1)*(m+2)/2-2, m>0} and then taking partial sums, starting with all 1's in row 0.at n=29A156628