16500
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 52416
- Proper Divisor Sum (Aliquot Sum)
- 35916
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4000
- Möbius Function
- 0
- Radical
- 330
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Nonperiodic autocorrelation functions of length n.at n=15A006606
- Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).at n=24A023069
- Expansion of Molien series for 8-dimensional real Clifford group 2^{1+6}.Alt_8.2 of genus 3 and order 5160960.at n=51A024186
- Expansion of Product_{k>=1} (1 + 3*x^k).at n=25A032308
- Numbers whose base-4 representation contains exactly four 0's and three 1's.at n=32A045036
- Composite numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=27A046358
- Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).at n=15A046366
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047120.at n=15A047121
- Number of bracketings of 0#0#0#...#0 giving result 0, where 0#0 = 0#1 = 1#0 = 1, 1#1 = 0.at n=11A055395
- There exists some k>0 such that n is the product of (k + digits of n).at n=18A055482
- Fourth binomial transform of binomial(n+3, 3).at n=5A081897
- Numbers n such that n=(d_1+5)(d_2+5)*...*(d_k+5), where d_1 d_2 ... d_k is the decimal expansion of n.at n=6A097371
- Difference between the product of two consecutive primes and the next prime.at n=30A111071
- Numbers n>9 such that n=Abs[(c+d_1)*(c+d_2)*...*(c+d_k)] where d_1 d_2 ... d_k is the decimal expansion of n and c is an integer constant.at n=32A113756
- Number of partitions of n such that the largest part and the smallest part are relatively prime.at n=35A117087
- Expansion of 2*x^2*(305-727*x-315*x^2+60*x^3)/((1-x)*(1-7*x+x^2)*(1+3*x+x^2)).at n=3A120719
- Number of ordered trees with n edges having no odd-length branches starting at the root.at n=12A127539
- Triangle T(n, k) = A002415(n-k+3)*A002415(k+3), read by rows.at n=43A129367
- Triangle T(n, k) = A002415(n-k+3)*A002415(k+3), read by rows.at n=37A129367
- Triangle, read by rows, where diagonal m of T equals diagonal m-1 of matrix power T^m for m>1: T(n,k) = [T^(n-k)](n-1,k) for n>=k>0, with T(n,n)=1 and T(n+1,n)=n+1 for n>=0.at n=30A132471