10951
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11232
- Proper Divisor Sum (Aliquot Sum)
- 281
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10672
- Möbius Function
- 1
- Radical
- 10951
- 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
- 161
- 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
- no
- Odd
- yes
Appears in sequences
- Numerators of continued fraction convergents to sqrt(219).at n=7A041408
- Numerators of continued fraction convergents to sqrt(876).at n=7A042692
- Greatest multiple of the n-th prime in A098962.at n=14A099620
- Number of partitions of n into Fibonacci parts if each part is of two kinds.at n=22A103577
- Number of partitions of n which represent first player winning Chomp positions with unique winning moves.at n=36A112472
- 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, 0), (-1, -1, 1), (-1, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=9A149086
- a(n) = 1250*n^2 - 100*n + 1.at n=2A154374
- a(n) = Fibonacci(n) + 5.at n=21A157729
- a(n) = 8*n^2 - 1.at n=36A157914
- The 180-degree spoke (or ray) of a hexagonal spiral of Ulam.at n=30A244806
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=18A245208
- Numbers n such that A003145(n) = floor(alpha^2*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=33A278352
- Numbers n such that A003146(n) = floor(alpha^3*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=8A278353
- Semiprimes whose binary and ternary representations are prime when read in decimal.at n=13A279052
- Number of n X 2 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0, 2 or 3 neighboring 1s.at n=8A296582
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0, 2 or 3 neighboring 1s.at n=46A296588
- Partial sums of A298038.at n=49A298039
- a(n) = Sum_{1 <= i <= j <= k <= n} gcd(i,j,k).at n=34A344521
- Number of partitions of n in which exactly one odd part is repeated and even parts are unrestricted.at n=36A353903
- a(0)=0; for n > 0, a(n) = 2*a(n-1) if n-1 is prime, a(n-1) + 1 otherwise.at n=39A354973