10131
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 4653
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6120
- Möbius Function
- -1
- Radical
- 10131
- 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
- 73
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (d(n)-r(n))/2, where d = A026057 and r is the periodic sequence with fundamental period (0,0,1,0).at n=42A026058
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 99.at n=30A031597
- Sum of the lengths of the cycle types of the permutation created by duality and reversal on the partitions of n.at n=32A036050
- Numbers whose base-10 representation has exactly 5 runs.at n=19A043641
- Coefficients of monic irreducible polynomials over GF(4) listed in lexicographic order.at n=32A058948
- a(n+1) is the smallest integer > a(n) such that the concatenation of [a(n+1)-a(n)] and a(n+1) is a prime number.at n=59A173699
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=31A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=31A213184
- Number of (n+1) X 5 0..1 matrices with each 2 X 2 subblock idempotent.at n=12A224546
- Indices of the start of 9 successive distinct digits in the decimal expansion of Pi.at n=33A258158
- Triangle read by rows of coefficients of polynomials C_n(x) = Sum_{k=0..n} (2*k)!*(x - 1)^(n-k)/((k + 1)!*k!).at n=67A271453
- Number of nX7 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.at n=3A297594
- T(n,k) = Number of n X k 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.at n=48A297595
- Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.at n=6A297597
- Expansion of (-1 + Product_{k>=1} 1 / (1 + (-x)^k))^9.at n=12A341251
- a(n) is the least multiple of n that contains exactly one more 1 in its decimal expansion than n does.at n=10A376165