10770
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 15150
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2864
- Möbius Function
- 1
- Radical
- 10770
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- yes
- Odd
- no
Appears in sequences
- Number of ternary codes of length 3 with n words.at n=11A034215
- Number of ternary codes of length 3 with n words.at n=16A034215
- Number of ternary codes (not necessarily linear) of length n with 11 words.at n=2A034231
- Number of asymmetric (identity) trees with n nodes and 5 leaves.at n=14A055336
- Number of subsets S of {1,2,...,n} which contain a number that is greater than the sum of the other numbers in S.at n=29A095944
- Inverse binomial transform of A120070.at n=12A141615
- Table of elementary symmetric functions a_k(1,2,5,6,...,n+2) (no 3,4).at n=39A196846
- Denominators of Bernoulli numbers which are == 6 (mod 9).at n=36A218755
- Numbers n for which n' + n and n' - n are both prime, n' being the arithmetic derivative of n.at n=29A229272
- Number of n X 2 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=8A281074
- T(n,k) = Number of n X k 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=46A281080
- T(n,k) = Number of n X k 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=53A281080
- a(n) = 384*4^n - 576*3^n + 220*2^n - 14.at n=3A305862
- Expansion of Product_{k>=1} (1 + x^k * (1 + k*x)).at n=20A336980
- Array read by ascending antidiagonals: A(n, k) = n!*[x^n] Li(-k, 1 - exp(-4*x))/(4*sinh(x)), where Li(n, z) is the polylogarithm function.at n=24A345394
- Number of nonnegative lattice paths from (0,0) to (n,0) using steps in {(1,-4), (1,-1), (1,0), (1,1)}.at n=11A348202
- a(n) = (1/2) * Sum_{k=0..floor(n/4)} 2^k * binomial(2*n-6*k+2,2*k+1).at n=13A387601