16799
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17064
- Proper Divisor Sum (Aliquot Sum)
- 265
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16536
- Möbius Function
- 1
- Radical
- 16799
- 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
- 71
- 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 k such that the period of the continued fraction for sqrt(k) contains exactly 23 ones.at n=11A031791
- Numbers whose base-7 representation contains exactly four 6's.at n=23A043420
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=21A045262
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=24A050780
- Numbers k such that 3*2^k + 35 is prime.at n=48A059759
- Prime(n)*prime(2*n)+prime(n)+prime(2*n).at n=22A072672
- Odd numbers n for which 17 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=19A112077
- a(n) = n^5 - n - 1.at n=6A126426
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (1, -1, 1), (1, 0, -1), (1, 0, 0)}.at n=10A148233
- Greatest number m such that the fractional part of (3/2)^A081464(n) <= 1/m.at n=11A153665
- Greatest number m such that the fractional part of (3/2)^A153662(n) <= 1/m.at n=4A153666
- a(n) = 42*n^2 - 1.at n=19A158626
- Numbers of the form |a^b - c^d| where a, b, c and d are the first 4 primes.at n=9A168385
- Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=23A175760
- Monotonic ordering of nonnegative differences 7^i-2^j, for 40>=i>=0, j>=0.at n=42A192119
- a(n) = round(3*(4/3)^n).at n=30A227391
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 201", based on the 5-celled von Neumann neighborhood.at n=14A279807
- Numerators of the partial sums of the reciprocals of the numbers (k + 1)*(5*k + 4) = 2*A005476(k+1), for k >= 0.at n=4A294831
- G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n * (1 + n*x - A(x))^(n+1), where A(0) = 0.at n=9A308027
- a(n) is the number of integers in base n such that all the integers given by their first k digits are divisible by k and which cannot be extended further.at n=10A380359