10372
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18158
- Proper Divisor Sum (Aliquot Sum)
- 7786
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 5186
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 42
- 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
- Number of Twopins positions.at n=47A005686
- Coordination sequence for MgCu2, Mg position.at n=25A009931
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=10A020437
- Number of n-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and three times sum of squares <= n^2*(n+1).at n=5A208797
- Number of n-bead necklaces labeled with numbers -6..6 allowing reversal, with sum zero and three times sum of squares <= n*(6)*(6+1).at n=5A208803
- T(n,k) = number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and three times sum of squares <= n*k*(k+1).at n=60A208805
- Level of the n-th plateau of the column k of the square array A195825, when k -> infinity.at n=11A210843
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=5A245208
- Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the numbers of A210843 multiplied by A000330(k), and the first element of column k is in row A000217(k).at n=28A249120
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 150", based on the 5-celled von Neumann neighborhood.at n=26A286088
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 150", based on the 5-celled von Neumann neighborhood.at n=27A286088
- Numbers k with exactly two distinct prime factors and such that phi(k) is a square, when: k = p^(2s) * q^(2t+1) with s >= 1, t >= 0, p <> q primes.at n=38A324747
- Numbers m for which p(m, 2)*p(m, 5) = p(m, 10), where p(m, b) is the period of repeating digits of 1/m in base b.at n=13A334488
- Numbers that are the sum of eight fourth powers in six or more ways.at n=30A345581
- Numbers that are the sum of eight fourth powers in seven or more ways.at n=6A345582
- Numbers that are the sum of eight fourth powers in exactly seven ways.at n=6A345839
- Number of edges in a square when n internal squares are drawn between the 4n points that divide each side into n+1 equal parts.at n=36A357061