16133
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18648
- Proper Divisor Sum (Aliquot Sum)
- 2515
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13824
- Möbius Function
- -1
- Radical
- 16133
- 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
- 71
- 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
- Numbers k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=19A006601
- a(n) = F(n) + L(n) + n, where F(n) (A000045) and L(n) (A000204) are Fibonacci and Lucas numbers respectively.at n=19A013915
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=39A066509
- Primitive subsequence of A111105.at n=28A137559
- Numerator of Euler(n, 5/27).at n=3A157099
- a(n) = 12*n^2 - 8*n + 1.at n=37A185212
- Table read by antidiagonals of numbers of form (2^n - 1)*2^(m+3) + 5 where n>=1, m>=1.at n=50A224701
- Irregular triangular array: row n lists the numbers D, each being the discriminant of the minimal polynomial of a quadratic irrational represented by a continued fraction with period an n-tuple of 1s and 2s.at n=48A246903
- Irregular triangular array: every periodic simple continued fraction CF represents a quadratic irrational (c + f*sqrt(d))/b, where b,c,f,d are integers and d is squarefree. Row n of this array shows the distinct values of d as CF ranges through the periodic continued fractions having period an n-tuple of 1s and 2s.at n=52A246904
- Number of subsets of {1,...,n} containing n and having at least one set partition into 8 blocks with equal element sum.at n=9A248117
- Number of ones on each row of irregular tables A252743 and A252744.at n=15A252745
- Numbers whose Euler totient function is equal to the product of the number of divisors of their k first powers, for some k.at n=34A283759
- a(n) = prime(1)^2 + prime(n)^2.at n=30A287922
- Poincaré series for invariant polynomial functions on the space of binary forms of degree 14.at n=21A293939
- Lexicographically earliest sequence of distinct positive integers such that for any n > 0, a(n) and a(n+1) are congruent modulo the n-th prime number, and the least value not yet in the sequence appears as soon as possible.at n=41A367290
- Number of vertices in the hyperoctahedral (or cocktail party) graph of order n.at n=13A368756
- Integers k such that k = a^2 + b^2 = c^2 + d^2 and a + b = 3(c - d), where a, b, c and d are distinct positive integers.at n=36A369498
- G.f.: Sum_{k>=0} x^k * Product_{j=1..6*k} (1 + x^j)/(1 - x^j).at n=20A385092