10779
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
- 4
- Divisor Sum
- 14376
- Proper Divisor Sum (Aliquot Sum)
- 3597
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7184
- Möbius Function
- 1
- Radical
- 10779
- 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
- 148
- 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
- a(n) = Sum_{m=1..n} T(m,n+1-m), array T as in A048887.at n=16A048888
- A106486-encodings of combinatorial games equivalent to game {0|0}.at n=31A125994
- 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, 0, 0), (0, -1, 1), (0, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150651
- Number of composites removed in each step of the Sieve of Eratosthenes for 10^7.at n=27A227155
- Number of partitions of n into distinct parts with boundary size 8.at n=33A227565
- a(n) = Sum_{k=1, n} phi(k)*index(k, n), with phi(k) the Euler totient A000010(k) and index(k,n) the position of 1/k in the n-th row of the Farey sequence of order k, A049805(n,k).at n=40A244396
- Number of odd prime powers (A246655) between 2^n and 2^(n+1).at n=17A244508
- Number of (n+2)X(2+2) 0..1 arrays with each row and column divisible by 7, read as a binary number with top and left being the most significant bits.at n=9A262314
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 414", based on the 5-celled von Neumann neighborhood.at n=29A272014
- Ulam numbers k such that k/3 is also an Ulam number.at n=21A287212
- Ulam numbers k such that 4*k and 16*k are also Ulam numbers.at n=15A287634
- Discriminants of imaginary quadratic fields with class number 38 (negated).at n=30A351676
- Numbers k such that 30*k - 1, 30*k + 1, 30*k^2 - 1 and 30*k^2 + 1 are all prime.at n=19A359184
- Number of minimum connected dominating sets in the n-flower graph.at n=7A382500