11706
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23424
- Proper Divisor Sum (Aliquot Sum)
- 11718
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3900
- Möbius Function
- -1
- Radical
- 11706
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=29A015991
- T(n,n), array T given by A047020.at n=9A047022
- Number of asymmetric (identity) trees with n nodes and 4 leaves.at n=34A055335
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=28A065215
- Index of first occurrence of the first n digits of e in the decimal expansion of Pi.at n=3A090898
- Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even.at n=32A120424
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)+1 are twin primes with p(h) = h-th prime.at n=18A129311
- Even indices of multidigit primes with digits in strictly increasing order.at n=30A155776
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 4, read by rows.at n=22A157150
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 4, read by rows.at n=26A157150
- 6 times centered hexagonal numbers: 18*n*(n+1) + 6.at n=25A164016
- Numbers k such that Sum_{i=1..k} i^9 divides Product_{i=1..k} i^9.at n=3A166609
- Sums of 3 consecutive semiprimes.at n=42A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=40A173969
- a(n)=f(a(n-1)+1,a(n-2)+1,a(n-3)), where f(x,y,z)=yz+zx+xy and (a(1),a(2),a(3))=(0,0,1).at n=7A203901
- Number of 0..n arrays of length 3 with each element differing from at least one neighbor by something other than 1.at n=22A221574
- Number of nondecreasing -2..2 vectors of length n whose dot product with some nonincreasing -2..2 vector equals n.at n=32A226393
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^9.at n=14A232964
- Number of partitions p of n such that the number of parts is a part or max(p) - min(p) is a part.at n=40A241386
- Numbers n such that the smallest prime divisor of n^2+1 is 101.at n=39A248553