16682
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26400
- Proper Divisor Sum (Aliquot Sum)
- 9718
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7884
- Möbius Function
- -1
- Radical
- 16682
- 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
- 128
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 7^n - n^3.at n=5A024078
- Numbers n such that n through n+5 have the same number of distinct prime factors.at n=18A045934
- Numbers n such that n through n+6 are divisible by the same number of distinct primes.at n=7A045935
- Numbers k such that (2^127-1)*2^k + 1 is prime.at n=15A098126
- Smallest number whose ninth power has at least n digits.at n=38A130083
- E.g.f.: Sum_{k>=1} (x^k/k! / Product_{i=1..k} (1-x^i)).at n=6A133148
- Numbers n such that primorial(n)/2 - 128 is prime.at n=17A139450
- 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, 1), (-1, 0, 1), (1, 1, -1), (1, 1, 0), (1, 1, 1)}.at n=7A150966
- Number of flat special rim-hook tableaux.at n=20A178940
- Differences between prime powers of primes, offsetting the prime and the power by only one. (For purposes of this sequence, 0 and 1 are treated as primes; see Formula.)at n=4A180203
- 1/4 the number of (n+1) X 7 binary arrays with all 2 X 2 subblock sums the same.at n=14A183983
- Monotonic ordering of nonnegative differences 7^i-5^j, for 40>= i>=0, j>=0.at n=18A192196
- Number of -6..6 arrays x(0..n-1) of n elements with zero sum and no two consecutive zero elements.at n=4A199528
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no two consecutive zero elements.at n=49A199530
- Number of -n..n arrays x(0..4) of 5 elements with zero sum and no two consecutive zero elements.at n=5A199532
- Number of solutions to rev(x^2) = rev(x)^2 with at most n digits, where the function rev(x) reverses the digits of x.at n=10A225301
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 1)/(x + 2).at n=50A231774
- Numbers k such that 3 is the smallest decimal digit of k^4.at n=35A291671
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 5 or 7 king-move adjacent elements, with upper left element zero.at n=10A304921
- Number of partitions of n into an even number of parts that are not multiples of 4.at n=47A339406