10366
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
- 8
- Divisor Sum
- 15984
- Proper Divisor Sum (Aliquot Sum)
- 5618
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- -1
- Radical
- 10366
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- yes
- Odd
- no
Appears in sequences
- Hit polynomials.at n=6A001885
- Nearest integer to Gamma(n + 1/6)/Gamma(1/6).at n=9A020036
- Ceiling of Gamma(n+1/6)/Gamma(1/6).at n=9A020126
- Numbers whose set of base-15 digits is {1,3}.at n=22A032922
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.at n=26A049712
- Number of numbers below 10^n with nonzero multiplicative digital root 3.at n=5A051823
- Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).at n=15A067282
- a(n) = 2*prime(n)*prime(n+1).at n=19A069486
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.at n=12A071141
- Numbers of the form 2*p*q where (p,q) is a twin prime pair.at n=7A071142
- Squarefree numbers k such that the largest prime factor of k is equal to the sum of the other prime factors of k.at n=12A071312
- Squarefree numbers k such that A076341(k) = 0.at n=11A076352
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.at n=38A080018
- Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes.at n=21A090833
- Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.at n=11A090836
- a(n) = A104908(n) - 10*A104863(n).at n=30A104909
- Triangle read by rows: T(n,1)=1, T(n,k) = T(n-1,k) + (n-1)T(n-1, k-1) for 1 <= k <= n.at n=48A109822
- Number of different values assumed by a/b+c/d as a,b,c,d range between 1 and n.at n=16A119868
- 1729-gonal numbers.at n=3A130859
- Composite numbers that are products of distinct primes and divisible by the sum of those primes.at n=31A131647