16727
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17160
- Proper Divisor Sum (Aliquot Sum)
- 433
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16296
- Möbius Function
- 1
- Radical
- 16727
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- Triangle read by rows: T(n,k) is the number of labeled monoids of order n with k idempotents and a fixed identity.at n=20A058158
- Triangle read by rows: T(n,k) = number of labeled semigroups of order n with k idempotents.at n=14A058166
- Numbers of the form 4^j + 7^k, for j and k >= 0.at n=37A226817
- a(1)=2; thereafter, a(n) is the smallest number not occurring earlier such that Kronecker(a(k), a(n)) = -1 for the next n indices k = n+1, n+2, ..., 2n.at n=24A249692
- Numbers of the form 7^x + y^7 with x, y >= 0.at n=23A250715
- a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=52A261227
- Composite numbers k such that 2^k == 1 (mod cototient(k)).at n=3A291619
- Number of labeled idempotent semigroups of order n.at n=5A351730