16117
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 299
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15820
- Möbius Function
- 1
- Radical
- 16117
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 97
- 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
- Numbers whose set of base-11 digits is {1,2}.at n=33A032931
- a(1) = 6, a(n) = smallest number of the form k*a(n-1) +1 with the same prime signature p*q (6 = 2*3), where p and q are primes.at n=7A085066
- a(1) = 6, a(n) = smallest number of the form k*a(n-1) + 1 with the same number of divisors, i.e., 4.at n=7A085067
- a(n) is the smallest term m in A173978 for which A020639(2m-3) = prime(n), n > 1.at n=37A173980
- Partial sums of A006864.at n=11A180488
- Number of nX4 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX4 array.at n=5A219591
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array.at n=41A219595
- Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 6Xn array.at n=3A219599
- Composite numbers coprime to 6 such that A179382(n) = A000265(n-1), the odd part of n-1.at n=27A225913
- Number of (n+1)X(2+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=3A235511
- Number of (n+1)X(4+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=1A235513
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=11A235517
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=13A235517
- Composite numbers whose sum of aliquot parts divides the sum of the aliquot parts of the numbers less than or equal to n and not relatively prime to n.at n=20A249109
- Odd numbers m that are neither of the form p + 2^k nor of the form p - 2^k with 2^k < m, k >= 1, and p prime.at n=19A255967
- Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).at n=31A256519
- Number of partitions p of n such that (number of numbers in p that have multiplicity 1) <= (number of numbers in p having multiplicity > 1).at n=39A330146
- Concatenate the terms of A027750 (omitting spaces and commas), chop into blocks of length 5, then omit any leading zeros.at n=11A362446
- a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is not a part of p.at n=38A365616