10767
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14896
- Proper Divisor Sum (Aliquot Sum)
- 4129
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- -1
- Radical
- 10767
- 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
- 73
- 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
- Number of partitions of n if there are two kinds of 1's and two kinds of 2's.at n=22A000097
- Positive numbers k such that k and 7*k are anagrams in base 8 (written in base 8).at n=5A023078
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=31A024480
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=30A025100
- a(n) = n-th prime number * n-th lucky number.at n=24A032601
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,1,0.at n=5A037794
- Numerators of continued fraction convergents to sqrt(820).at n=8A042582
- Negative of column k=7 sequence of array A103728.at n=2A103734
- Negative of column k=9 sequence of array A103728.at n=2A103914
- a(n) = 5n^4 - 4n^3 + 3n^2 - 2n + 1.at n=7A131466
- a(n) = n*(8*n-5).at n=37A139272
- Triangle read by rows: t(n,m)=(1 + n!)*Binomial[n, m]-n!/Binomial[n, m].at n=23A144397
- Triangle read by rows: t(n,m)=(1 + n!)*Binomial[n, m]-n!/Binomial[n, m].at n=25A144397
- Triangle of 5-Eulerian numbers.at n=23A144699
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {-1,0,1}.at n=32A209993
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=26A277171
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=27A277171
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=28A277171
- G.f. A(x) satisfies: A(x) = A(x)^2 - x*A(x)^3 + x^2.at n=10A295404
- Numbers k such that A007088(k) == 1 (mod k).at n=13A339567