10752
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 32736
- Proper Divisor Sum (Aliquot Sum)
- 21984
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3072
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 11
- 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
- 16
- 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
- Glaisher's function J(n) (18 squares version).at n=27A002613
- Triangle of coefficients of Euler polynomials 2^n*E_n(x) (exponents in increasing order).at n=51A004174
- Triangle of coefficients of Euler polynomials 2^n*E_n(x) (exponents in decreasing order).at n=48A004175
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=33A007419
- Triangle of coefficients of expansions of powers of x in terms of Legendre polynomials P_n(x) over common denominator.at n=47A008317
- Expansion of tan(sin(x))/cos(x).at n=4A009668
- a(n) = Sum_{j=1..n} j*prime(j).at n=20A014285
- Numbers j such that sigma(sigma(j)) = k*j for some k.at n=25A019278
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,9)-perfect numbers.at n=1A019286
- Expansion of Product_{m>=1} (1+x^m)^4.at n=14A022569
- Number of divisors of n!.at n=17A027423
- a(n+1) = Sum_{k=0..floor(n/4)} a(k) * a(n-k).at n=19A030034
- Number of symmetrically inequivalent coincidence rotations of index 2n-1 in lattice D_4.at n=31A031360
- 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 51.at n=35A031549
- Relative class number h- of cyclotomic field Q(zeta_m) where m is n-th term of A035113.at n=71A035115
- Number of labeled trees with 2-colored leaves.at n=6A038054
- Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*4^j.at n=30A038210
- Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*2^j.at n=33A038232
- Numbers whose base-4 representation contains exactly four 0's and three 2's.at n=14A045060
- Numbers that are divisible by at least 10 primes (counted with multiplicity).at n=35A046313