10710
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 33696
- Proper Divisor Sum (Aliquot Sum)
- 22986
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- 0
- Radical
- 3570
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 5
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
- 99
- 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
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=43A000092
- Number of n-node labeled acyclic digraphs with 2 out-points.at n=3A003026
- G.f.: 2*(1-x^3)/((1-x)^5*(1+x)^2).at n=33A005996
- a(n) = floor(n*(n-1)*(n-2)/4).at n=36A011886
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=18A033829
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,0.at n=5A037668
- Numerators of continued fraction convergents to sqrt(890).at n=5A042720
- Theta series of 14-dimensional lattice C2 X S7 with minimal norm 4.at n=4A047633
- Numbers that are divisible by exactly 5 different primes.at n=37A051270
- a(n) = n*(n+1)*(2*n+1).at n=17A055112
- Largest area of a Pythagorean triangle with n as length of one of the three sides (in fact as a leg).at n=32A055522
- Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).at n=13A058876
- a(n) = 3*n*(4*n-1).at n=30A062783
- Engel expansion of sinh(1/3).at n=17A068380
- Numbers k such that phi(k) = tau(k)^2.at n=28A068560
- Trajectory of 318 under the Reverse and Add! operation carried out in base 4, written in base 10.at n=4A075153
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges and k branches.at n=61A091187
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peaks at even height.at n=59A091869
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^4-M)/3, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=41A096035
- a(n) = p*(p + 1)*(2*p + 1) where p is the n-th prime.at n=6A098996