10769
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11970
- Proper Divisor Sum (Aliquot Sum)
- 1201
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9680
- Möbius Function
- 0
- Radical
- 979
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- Numbers k such that 209*2^k+1 is prime.at n=16A032481
- Integer averages of first n perfect powers for some n.at n=4A075457
- Number of fib101 primes (A095089) in range ]2^n,2^(n+1)].at n=19A095069
- Triangle read by rows: T(n,k) is the number of k-matchings in the P_4 X P_n lattice graph.at n=29A100265
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at odd height.at n=38A101894
- Number of strings of numbers x(i=1..n) in 0..4 with sum i^3*x(i) equal to n^3*4.at n=11A184252
- a(n) = 11*a(n-1) - 11*a(n-2), a(0)=0, a(1)=1.at n=5A190871
- Number of partitions of n containing at least one part m-10 if m is the largest part.at n=31A212550
- An avoidance sequence for a pair of tree patterns that is not the avoidance sequence for any set of permutations.at n=46A221720
- a(n) = n^2*Fibonacci(n).at n=11A259451
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 633", based on the 5-celled von Neumann neighborhood.at n=20A273301
- Number of minimal dominating sets in the n-pan graph.at n=26A290273
- a(n) = 1 + F(2*n+1) - (F(n+4) - (-1)^n*F(n-2))/2 where F=A000045.at n=10A330051
- The lower (or left) offset of a 196-iterate (A006960) from the largest palindrome less than the iterate.at n=9A331556
- a(n) is the smallest number k such that k occurs in the Reverse-and-Add trajectories of exactly n positive integers less than k.at n=41A355548