16758
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 44460
- Proper Divisor Sum (Aliquot Sum)
- 27702
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4536
- Möbius Function
- 0
- Radical
- 798
- Omega Function (Ω)
- 6
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 159
- 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
- Heptagonal (or 7-gonal) pyramidal numbers: a(n) = n*(n+1)*(5*n-2)/6.at n=27A002413
- Positive integers n such that n | (2^n + n/2 - 1).at n=39A015942
- Least k such that k*11^n +/- 1 are twin primes.at n=41A064220
- Numbers whose set of base 7 digits is {0,6}.at n=28A097253
- Structured disdyakis dodecahedral numbers (vertex structure 9).at n=13A100161
- Triangular array formed by the Mersenne numbers.at n=49A110441
- Number of 3 X 3 symmetric matrices over Z(n) having determinant 1.at n=6A115224
- a(1) = 1. a(n) = a(n-1) + a(m), where m is the largest term of the sequence {a(k)} which is less than n.at n=35A133488
- a(n) = n^5 - n^2.at n=7A135497
- a(n) = prime(n)^5 - prime(n)^2.at n=3A138405
- Numbers k such that 64*k^6 + 1091 is prime.at n=19A155809
- Number of lines through at least 2 points of a 7 X n grid of points.at n=39A160847
- Even heptagonal pyramidal numbers.at n=19A218325
- Number of 3 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=27A224134
- Numbers m such that k*phi(n) = Sum_{j|n} sigma(j), where k >= 1 is an integer.at n=25A243373
- Depth of Pascal's triangle such that the number of elements in the triangle is a factor of the sum of the elements.at n=18A272934
- Number of partitions p of n that contain a proper partition of the maximal part of p.at n=36A279036
- Numbers k such that 78*10^k - 7 is prime.at n=21A287210
- a(n) = Product_{d|n, d>1} prime(gcd(d,n/d)).at n=63A294876
- Numbers m such that m^2 + p^2 = k^2, with p > 0, where p = A007954(m) = the product of digits of m.at n=8A334558