16577
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18354
- Proper Divisor Sum (Aliquot Sum)
- 1777
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14960
- Möbius Function
- 0
- Radical
- 1507
- 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
- 115
- 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(n) = a(n-2) + a(n-5).at n=52A001687
- a(n) = 4^(n+1) + 3*2^n + 1.at n=7A036562
- Denominators of continued fraction convergents to sqrt(467).at n=10A041891
- Lower triangular matrix T, read by rows, such that row (n) is formed from the sums of adjacent terms in row (n-1) of the matrix square T^2, with T(0,0)=1.at n=42A097710
- Expansion of 1/(1-x^2*(1+x)^3).at n=17A116090
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 11011-01110-00100 pattern in any orientation.at n=11A147488
- Numbers k which are concatenations k=x//y such that x^2 + y^2 is a multiple of k.at n=20A162463
- Numbers n such that the sum of the numbers in the Collatz (3x+1) iteration of n is a perfect square.at n=39A225866
- S_9 sequence in partition of integers > 1 described in A240521.at n=36A240536
- Number of pieces after a sheet of paper is folded n times and cut diagonally.at n=15A257418
- Consider the sum of the divisors of a number x>1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach x.at n=12A269307
- Integers which can be written in exactly three ways as sum of two distinct nonzero pentagonal numbers.at n=11A333013
- a(0)=3; for n > 0, a(n) = 2^(2*n) + 3*2^(n-1) + 1.at n=7A343176
- Number of sets of nonempty words over binary alphabet with a total of n letters of which 2 are the first letter.at n=20A360650
- G.f. A(x) satisfies A(x) = 1 + x^3*(1+x)*A(x)^2.at n=24A366588
- Expansion of 1/(1 - x^5/(1-x)^7).at n=15A369808
- Number of compositions of 5*n-4 into parts 2 and 5.at n=10A369844
- a(n) = 12*n^2 + 4*n + 1.at n=37A381390
- a(n) = Sum_{k=0..floor(2*n/5)} binomial(2*k,2*n-5*k).at n=25A392429
- Expansion of 1 / ((1-x)^2 - x^5).at n=23A392540