10712
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 11128
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 2678
- Omega Function (Ω)
- 5
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 29
- 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
- a(n) = (3*n+1)*(3*n+2).at n=34A001504
- a(n) = (1/(8*n)) * Sum_{d|n} mu(n/d) * binomial(2*d,d)^3.at n=3A029807
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=19A033829
- Product of a prime and the following number.at n=26A036690
- Gaps of 5 in sequence A038593 (lower terms).at n=2A038649
- Numbers ending with '2' that are the difference of two positive cubes.at n=28A038857
- Numbers that are the sum of two (possibly negative) cubes in at least 2 ways.at n=34A051347
- Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=29A054573
- Numbers n such that Fibonacci(n) is not squarefree, but for all proper divisors k of n, Fibonacci(k) is squarefree.at n=28A065069
- Expansion of (1+x*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=7A070857
- Maximum of A073830(k) for k between A001359(n) and A001359(n+1).at n=8A073831
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=31A075604
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=42A080392
- Numbers k such that the largest prime power factor of k equals floor(sqrt(k)).at n=42A081807
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=29A091854
- Lesser of a,b where n^2 = a^3 + b^3; a,b > 0 and gcd(a,b)=1. The greater of a,b is the corresponding term in A099533 and n, which is used to order this sequence, is the corresponding term in A099426.at n=33A099532
- a(n) = 4*n*(4*n - 1).at n=26A104188
- Triangle read by rows: T(n,k) is the number of Dyck n-paths containing k even-length descents to ground level.at n=38A111301
- a(n) = smallest positive multiple of n that, when represented in binary, contains the binary representations of all positive integers <= n at least once each.at n=12A144144
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 1)}.at n=9A148732