10472
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 15448
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 2618
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- E.g.f.: -log(1+log(1+log(1-x))).at n=5A000268
- Fermat coefficients.at n=15A000970
- Number of dissections of a polygon: binomial(7n,n)/(6n+1).at n=5A002296
- Molien series for cyclic group of order 5.at n=31A008646
- If a, b in sequence, so is ab+8.at n=41A009331
- a(n) = floor(C(n,4)/5).at n=35A011795
- Schoenheim bound L_1(n,5,4).at n=30A036832
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x8^2 = n.at n=35A045850
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), with a(1) = a(2) = 1 and a(3) = 2.at n=14A049938
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=31A051170
- Number of symmetric types of (3,2n)-hypergraphs under action of complementing group C(3,2).at n=31A055780
- a(n) = A083964(n)/(2n-1).at n=10A083965
- Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).at n=12A094530
- Numbers k such that 5^k - 2 is prime.at n=10A109080
- Triangle read by rows, generated from Stirling cycle numbers.at n=33A111933
- a(n)=a(n-1)+6a(n-2), n>2.at n=8A140796
- G.f. A(x) satisfies A(x) = 1 + x*A(x)^4*A(-x)^3.at n=10A143547
- a(n) = binomial((n+1)^2, n) / (n+1)^2.at n=5A143669
- a(n) = n*(9*n+2).at n=34A147296
- G.f.: A(x) = exp( Sum_{n>=1} 2^n*A006519(n) * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=11A162589