16610
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32832
- Proper Divisor Sum (Aliquot Sum)
- 16222
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- 1
- Radical
- 16610
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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) is least k such that k and 6k are anagrams in base n (written in base 10).at n=16A023098
- Expansion of 1/((1-5x)(1-9x)(1-11x)(1-12x)).at n=3A028198
- Numerators of continued fraction convergents to sqrt(522).at n=8A041998
- Numbers whose base-7 representation contains exactly four 6's.at n=14A043420
- Numbers with exactly 4 distinct palindromic prime factors.at n=39A046402
- Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).at n=21A059321
- Numbers k such that tau(k) = tau(k+1) mod 691, where tau is Ramanujan's tau function A000594.at n=26A121733
- Numbers k such that k^3 divides 3^(k^2) - 1.at n=38A129211
- Series reversion of x * (1 - x) / (1 + 9*x).at n=5A143749
- a(n) = the smallest k such that k^2+1 = p*A002144(n)^2, p prime of A002144 .at n=21A174492
- T(n,k)=number of nXk binary matrices with rows and columns each in strictly increasing order as binary numbers and each row and column having an odd number of 1s.at n=83A181000
- T(n,k)=number of nXk binary matrices with rows and columns each in strictly increasing order as binary numbers and each row and column having an odd number of 1s.at n=85A181000
- Number of (n+2)Xn binary matrices with rows and columns each in strictly increasing order as binary numbers and each row and column having an odd number of 1s.at n=5A181001
- Numbers n such that n^2 + 1 has two distinct prime divisors less than n.at n=22A263876
- Records in A171797 starting from a(1).at n=32A305396
- a(n)^2 is the end of the first occurrence of n consecutive perfect powers, all of which are squares with exponents equal to 2 (A111245).at n=38A340664
- Numbers that are the sum of six fourth powers in four or more ways.at n=19A345561
- Numbers that are the sum of six fourth powers in five or more ways.at n=1A345562
- Numbers that are the sum of six fourth powers in exactly five ways.at n=1A345817
- a(n) is the number of compositions of n into prime parts, with the 1st part equal to 2, the 2nd part less than or equal to 3, ..., and the k-th part less than or equal to prime(k), and so on.at n=31A359388