16022
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 24036
- Proper Divisor Sum (Aliquot Sum)
- 8014
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8010
- Möbius Function
- 1
- Radical
- 16022
- 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
- 53
- 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
- yes
- Odd
- no
Appears in sequences
- Numerators of continued fraction convergents to sqrt(211).at n=8A041392
- Numbers n such that the least positive primitive root of n is larger than the value for all positive numbers smaller than n.at n=12A081888
- Least k such that k*Mersenne-prime(n)-1 is prime.at n=23A098555
- Nearest k to j such that k*(2^j-1)-1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.at n=23A101416
- Semiprimes of the form 2*(m^2 + m + 1) (implying that m^2 + m + 1 is a prime).at n=29A107317
- Smallest number with n as least nonnegative primitive root, or 0 if no such number exists.at n=43A214158
- Cyclops numbers whose squares are cyclops numbers.at n=23A239827
- Number of partitions p of n such that the number of numbers p having multiplicity 1 in p is not a part and the number of numbers having multiplicity > 1 is not a part.at n=46A241417
- The least x > 0 such that x < the number of zero digits in the base-n expansions of the numbers 1 through x.at n=3A245491
- Lower ends of record gaps between numbers that are either primes or semiprimes.at n=6A275013
- Least number that is the start of a prime-semiprime gap of size n.at n=10A278351
- Number of compositions (ordered partitions) of n into distinct parts such that the smallest part is equal to the number of parts.at n=53A339446
- Number of integer partitions of n whose second differences sum to 0, meaning either there is only one part, or the first two parts have the same difference as the last two parts.at n=46A360683
- Expansion of (1 - x^2 - x^3)/((1 - x^2 - x^3)^2 - 4*x^5).at n=20A376729