10180
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21420
- Proper Divisor Sum (Aliquot Sum)
- 11240
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4064
- Möbius Function
- 0
- Radical
- 5090
- 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
- yes
- 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 partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=51A036816
- 15-gonal (or pentadecagonal) numbers: n*(13n-11)/2.at n=40A051867
- Values of m, the main key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.at n=36A051891
- Numbers k such that 291*2^k + 1 is prime.at n=28A053362
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.at n=34A079094
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={0,1}.at n=32A080013
- a(n) = 2*a(n-1) - a(n-4) + a(n-5) with a(-1)=a(0)=a(1)=1, a(2)=2, a(3)=4, a(4)=7.at n=16A108758
- Numbers k such that k + sigma(k) + sigma(sigma(k)) is a square.at n=29A116014
- "Crossing Hamiltonian walks" on the square lattice (see Jensen web site for further information).at n=4A121788
- a(n) = Sum_{k=0..n} C(n,floor(k/2))*(-3)^(n-k).at n=8A127362
- a(n) = Sum_{k=0..n} C(n,floor(k/2))*(-1)^k*3^(n-k).at n=8A133443
- Binomial transform of [1, 3, 7, 0, 0, 0, ...].at n=54A140063
- Number of line segments connecting exactly 3 points in an n X n grid of points.at n=18A177719
- Least number having n orderless representations as p^2 + q^2 + r^2 + s^2, where p, q, r, and s are primes.at n=42A214513
- a(n) = Sum_{i=0..n} digsum(i)^3, where digsum(i) = A007953(i).at n=34A231688
- The 240-degree spoke (or ray) of a hexagonal spiral of Ulam.at n=29A244805
- Number of nonisomorphic synchronizing strongly connected binary n-state automata without output under input permutations.at n=3A245686
- Numbers n such that the smallest prime divisor of n^2+1 is 89.at n=39A248551
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 1.at n=34A259577
- Number of (1+1) X (n+1) arrays of permutations of 0..n*2+1 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=14A264507