10270
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
- 16
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 9890
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 1
- Radical
- 10270
- Omega Function (Ω)
- 4
- 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
- no
- 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
- yes
- 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
- Expansion of 1/(1-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18-x^19).at n=71A017895
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=31A023862
- a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=30A023870
- Sum of antidiagonals of A060736.at n=26A061349
- Arrange n^2 octagons that each have area 7 so that they leave (n-1)^2 square gaps each with area 2; a(n) is the total area of these polygons.at n=33A086640
- a(n) = Sum_{i=n..n+3} Sum_{j=i+1..n+4} prime(i)*prime(j).at n=8A127350
- Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=18A145290
- Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=13A166776
- Numbers k such that 9*k! + 1 is prime.at n=25A180626
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w=x+y+z+n.at n=29A212247
- Expansion of (chi(-x) / chi^3(-x^3))^2 in powers of x where chi() is a Ramanujan theta function.at n=33A216046
- Number of 3-element subsets of {1,...,n} whose sum has more than 2 divisors.at n=43A241563
- Number of unlabeled rooted trees with n nodes where the outdegrees (branching factors) of at least one pair of adjacent nodes differ by at least two and the outdegrees of at least one pair of adjacent nodes are equal.at n=13A253244
- Triangle read by rows: number of topologies of n nested circles intersecting at most as binaries, according to number of factors.at n=36A281348
- Records in A181159.at n=24A306332
- Expansion of Product_{k>=1} 1/(1 - x^k)^((5*k-1)*binomial(k+2,3)/4).at n=7A317020
- Lexicographically first sequence starting with a(1) = 1, with no duplicate term, such that a(n) is the result of a self-additive linear combination of its own digits (concatenated sometimes into substrings).at n=48A323823
- a(n) is the number of vertices formed by n-secting the angles of a pentagon.at n=40A335554
- Number of pairwise coprime compositions of n, where a singleton is not considered coprime unless it is (1).at n=20A337462
- Number of connected subsets of n edges of the icosahedron up to the 120 rotations and reflections of the icosahedron.at n=8A383974