10132
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18900
- Proper Divisor Sum (Aliquot Sum)
- 8768
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4736
- Möbius Function
- 0
- Radical
- 5066
- Omega Function (Ω)
- 4
- 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
- 34
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_79 of Monster module.at n=38A034467
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=16A037159
- Positive numbers having the same set of digits in base 4 and base 10.at n=38A037428
- Numbers whose base-10 representation has exactly 5 runs.at n=20A043641
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=29A047881
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).at n=34A051872
- Coefficients of monic irreducible polynomials over GF(4) listed in lexicographic order.at n=33A058948
- Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order.at n=28A058950
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.at n=19A058952
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=33A075604
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=13A089493
- Coefficient of the irreducible character of S_m indexed by (m-2n+2,2n-2) in the n-th Kronecker power of the representation indexed by (m-2,2).at n=17A090809
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=27A091854
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.at n=37A092230
- a(0)=1; a(n) = sigma_2(n) + sigma_3(n).at n=21A092344
- A sequence generated from a 4th degree Pascal's Triangle polynomial.at n=11A095265
- Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.at n=34A107411
- Number of permutations of length n which avoid the patterns 2341, 3241, 4132.at n=8A116817
- Numbers n such that n is divisible by (3*s(n)*s(n)+2), where s(n) = sum of digits of n.at n=35A134556
- Number of partitions of n minus the number of primes <= n.at n=32A183151