16765
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 6275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11472
- Möbius Function
- -1
- Radical
- 16765
- Omega Function (Ω)
- 3
- 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
- 110
- 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
- no
- Odd
- yes
Appears in sequences
- Molien series for group G_{1,2}^{8} of order 1536.at n=33A051462
- Row 4 of A007754.at n=9A058795
- Number of partitions of n with no part larger than n/2. Also partitions of n into n/2 or fewer parts.at n=36A110618
- 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, -1, 0), (-1, 1, 0), (0, 0, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149659
- Numbers k such that 30 plus the k-th triangular number is a perfect square.at n=9A154154
- Numbers n for which A020652(n)/A038567(n) = A182972(n)/A182973(n).at n=7A182974
- Number of nondecreasing arrangements of 4 numbers in -(n+2)..(n+2) with sum zero.at n=38A188212
- a(n) = n*(14*n - 11).at n=35A195021
- a(n) = (n-2)*(14*n-39) for n > 2, otherwise a(n) = n.at n=37A195030
- Number of partitions of 2n in which every part is <n+1; also, the number of partitions of 2 into rational numbers a/b such that 0<a<=b<=n and b divides n.at n=17A209816
- a(n) = (prime(1+n)*prime(n)) + prime(n) + 1.at n=30A286624
- Number of integer partitions of n whose greatest part is at most one more than the sum of the other parts.at n=36A336106