16652
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30576
- Proper Divisor Sum (Aliquot Sum)
- 13924
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- 0
- Radical
- 8326
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 66
- 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
- yes
- Odd
- no
Appears in sequences
- Molien series for group Gamma_{3,0}(2).at n=22A027632
- Coefficients of a polynomial used in calculation of A055914.at n=9A055917
- Irreducible polynomial coefficient of singular value associated with sqrt(2n).at n=24A078878
- Sum of first n 7-almost primes.at n=21A086059
- If n==0 (mod 3) then a(n)=a(n-1); if n==1 (mod 3) then a(n)=a(n-2)+a(n-3); if n==2 (mod 3) then a(n)=a(n-3)+a(n-4)+a(n-5).at n=35A104204
- If n==0 (mod 3) then a(n)=a(n-1); if n==1 (mod 3) then a(n)=a(n-2)+a(n-3); if n==2 (mod 3) then a(n)=a(n-3)+a(n-4)+a(n-5).at n=36A104204
- 1/4 the number of (n+1) X 5 binary arrays with all 2 X 2 subblock sums the same.at n=14A183981
- a(n) = floor(n^(3/2))*floor(3+n^(3/2))/2.at n=31A185593
- Number of nonnegative solutions to x^3 + y^3 + z^3 <= n^3.at n=28A224215
- Numbers n such that Bernoulli number B_{n} has denominator 1410.at n=20A272369
- Sum of the odd parts in the partitions of n into 4 parts.at n=46A309517
- Number of partitions of n with up to ten distinct kinds of 1.at n=16A320697
- MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed).at n=27A326260
- a(n) is the smallest number k such that n consecutive integers starting at k have the same number of n-gonal divisors.at n=2A358634
- Number of distinct non-subset-sums of integer partitions of n.at n=29A365918
- a(n) = Sum_{k=0..n} (k+1) * 2^(n-k) * binomial(2*k+1,2*n-2*k+1).at n=7A391892