10986
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21984
- Proper Divisor Sum (Aliquot Sum)
- 10998
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3660
- Möbius Function
- -1
- Radical
- 10986
- 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
- 130
- 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
- a(n) = floor(10000*log(n)).at n=2A004243
- a(n) = 10000*log(n) rounded to nearest integer.at n=2A004244
- Sets of 4 consecutive numbers with equal number of divisors.at n=35A039665
- Number of ternary words of length n (beginning with 0) with autocorrelation function 2^(n-1).at n=9A045694
- a(n) is the smallest integer such that the sum of any three ordered terms a(k), k <= n, is unique.at n=19A051912
- a(n) = round(10000*log(n/10)).at n=29A104077
- a(n) = 2*(n-1) + Fibonacci(n).at n=20A129728
- a(n) = Sum_{k=0..n} C((n-k)*k, k) * C((n-k)*k, n-k).at n=6A137645
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,3,4,1 for x=0,1,2,3,4.at n=6A196203
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,3,4,1 for x=0,1,2,3,4.at n=6A196209
- Number of (n+2) X 8 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=17A204752
- Numbers that divide the sum of the reverse of their divisors (A069192).at n=11A254008
- Palindromic numbers in bases 4 and 8 written in base 10.at n=32A259382
- Concatenate the n-th prime with the n-th semiprime.at n=28A262428
- a(n) is the first k such that A277515(k) is the n-th prime.at n=18A278107
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 179", based on the 5-celled von Neumann neighborhood.at n=13A279668
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=26A288044
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=27A288044
- Ascending list of base-60 happy numbers written in base 10.at n=29A318235
- a(n) is the number of balanced-non-self-conjugate partitions of n.at n=50A331262