10178
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
- 8
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 7294
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4356
- Möbius Function
- -1
- Radical
- 10178
- 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
- 86
- 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
- Number of carbon trees with n carbon atoms.at n=11A005962
- Number of 8's in all partitions of n.at n=39A024792
- Near Cullen numbers: k such that (k+1)*2^k + 1 is prime.at n=22A029544
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 100.at n=15A031598
- Partial sums of A001157: Sum_{j=1..n} sigma_2(j).at n=28A064602
- a(n) = floor(2^n*log(n)).at n=11A094939
- Number of 6k+5 primes (A007528) in range [2^n,2^(n+1)].at n=17A095016
- a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).at n=12A096973
- 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, 0), (1, -1, 0), (1, 0, 1), (1, 1, -1)}.at n=9A148790
- Number of ways to place 3 nonattacking nightriders on a 3 X n board.at n=14A172218
- Number of partitions of n into consecutive initial Fibonacci numbers.at n=47A172491
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=22A181882
- Number of 0..n arrays x(0..11) of 12 elements with zero 6th differences.at n=36A200374
- Triangle read by rows: T(n,k) is the number of secondary structures of size n having k stacks of even length (n>=0, k>=0).at n=32A202848
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=22A213319
- G.f. satisfies: A(x) = exp(Sum_{n>=1} x^n*A(x)^n/n * Product_{k>=1} (1 + x^(n*k)*A(x^k)^n)).at n=8A219260
- a(0) = a(1) = 1; a(n) = [x^n] Product_{k=1..n-1} (1 + x^a(k))/(1 - x^a(k)).at n=43A296387
- a(n) is the greatest nonnegative number which has a partition into a triangular number (A000217), a square number (A000290), and a pentagonal number (A000326) in n different ways.at n=39A327792
- Numbers k such that the number of divisors of k^2 equals the number of divisors of phi(k), where phi is the Euler totient function.at n=36A363059
- Number of integer compositions of n that are the first sums of more than one nonnegative sequence.at n=17A391682