11486
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17232
- Proper Divisor Sum (Aliquot Sum)
- 5746
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5742
- Möbius Function
- 1
- Radical
- 11486
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=30A024686
- Number of trees with n 2-colored nodes.at n=8A038056
- Numbers k such that (k+3, k+5, k+17, k+257, k+65537) are all primes.at n=13A063799
- 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, 0), (0, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150774
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k doubledescents (0 <= k <= n-2). We say that i is a doubledescent (also called a double fall) of a permutation p if p(i) > p(i+1) > p(i+2).at n=43A162975
- Number of binary strings of length n with equal numbers of 00010 and 10001 substrings.at n=14A164220
- G.f. satisfies: A(x) = 1 + x*A(x*A(x*A(x*A(x*...x*A(x*...)^n...)^4)^3)^2)^1.at n=7A190633
- Number of -n..n arrays x(0..6) of 7 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=26A200185
- Number of n X 4 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 in row major order.at n=2A233094
- T(n,k)=Number of nXk 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 in row major order.at n=17A233098
- Number of 3 X n 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 in row major order.at n=3A233100
- Number of partitions p of n such that median(p) > mean(p).at n=46A240220
- Number of n X 2 0..2 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=4A278303
- Number of nX5 0..2 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=1A278306
- T(n,k)=Number of nXk 0..2 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=16A278309
- T(n,k)=Number of nXk 0..2 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=19A278309
- a(n) = Sum_{k=0..n} ceiling((1 + sqrt(2))^k).at n=10A279101
- Number of permutations of [n] having exactly five (possibly overlapping) doubledescents.at n=3A279294
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=11A305478
- Semiprimes s = A001358(k) such that k, s - k and s + k are also semiprimes.at n=40A383468