10763
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11040
- Proper Divisor Sum (Aliquot Sum)
- 277
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10488
- Möbius Function
- 1
- Radical
- 10763
- 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
- 73
- 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
- Number of paraffins.at n=35A005999
- a(n) = (d(n)-r(n))/2, where d = A026057 and r is the periodic sequence with fundamental period (0,0,1,0).at n=43A026058
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 19 ones.at n=4A031787
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n.at n=35A057250
- Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.at n=18A065824
- a(n) = A065824(A047845(n+1)).at n=7A065884
- Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.at n=27A082056
- a(n) = index of the first occurrence of n in A088606.at n=37A088757
- Numbers k such that k and k^2 together contain all ten digits.at n=34A122477
- Smallest number k such that k^n is equal to the sum of n consecutive primes, or 1 if it does not exist.at n=34A123112
- A106486-encodings of combinatorial games equivalent to game {0|0}.at n=29A125994
- 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, 0), (-1, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=8A149982
- 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, 0, 1), (0, 0, 1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=7A150635
- Minimal exponents m such that the fractional part of (101/100)^m obtains a maximum (when starting with m=1).at n=75A153671
- Numbers k such that the fractional part of (101/100)^k is greater than 1-(1/k).at n=6A153672
- Integer part of square root of n^5 = A000584(n).at n=40A155013
- a(n) = 4*n^2 - n - 1.at n=52A185950
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array.at n=17A219167
- Number of (n+2) X 7 0..1 matrices with each 3 X 3 subblock idempotent.at n=13A224556
- G.f.: exp( Sum_{n>=1} A056789(n)*x^n/n ), where A056789(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).at n=15A226455