10927
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12768
- Proper Divisor Sum (Aliquot Sum)
- 1841
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9324
- Möbius Function
- 0
- Radical
- 1561
- Omega Function (Ω)
- 3
- 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
- 55
- 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
- no
- Odd
- yes
Appears in sequences
- A nonlinear binomial sum.at n=17A000126
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=23A015991
- a(n) = T(2n-1,n), where T is the array in A026098.at n=47A026102
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=8A028948
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=32A060630
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=22A065215
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutations A074681/A074682 & A074683/A074684.at n=10A086586
- Number of distinct products i*j*k*l for 1 <= i <= j <= k <= l <= n.at n=30A100437
- 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, 0, 1), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A149025
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=33A165463
- Numbers k such that 9k+4 are terms in A072841.at n=26A175518
- 50k^2-20k-23 interleaved with 50k^2+30k+17 for k=>0.at n=30A217894
- Expansion of Sum_{n>=1} ((n-1) * q^(n*(n+1)/2) / Product_{k=1..n} (1 - q^k)).at n=47A218074
- Least number k such that k concatenated with n is a cube, or 0 if no such k exists.at n=26A246561
- a(n) = number of triples (a,b,c) of natural numbers a,b,c <= n with gcd(a,b)=gcd(b,c)=gcd(c,a)=1.at n=32A256390
- a(n) = 2*a(n - 2) - a(n - 1) for n>1, a(0) = 4, a(1) = 5.at n=15A268741
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 798", based on the 5-celled von Neumann neighborhood.at n=26A273571
- Number of ways to tile a 2 X n grid with dominoes and L-trominoes such that no four tiles meet at a corner.at n=13A329185
- Number of compositions of n with runs-resistance 2.at n=17A329745
- Numbers k such that k, k + 1 and k + 2 are all norm-deficient in Gaussian integers (A332572).at n=37A332574