16465
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 4055
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12672
- Möbius Function
- -1
- Radical
- 16465
- 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
- 115
- 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
- Number of permutations of length n with longest increasing subsequence of length 6.at n=3A001457
- Number of paraffins.at n=32A006001
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 28.at n=2A031616
- Sums of 4 distinct powers of 4.at n=37A038472
- Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=2A045037
- Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).at n=41A047874
- Triangle of numbers read by rows: T(n,k) = number of permutations sigma of (1,2,...,n) with n - {length of longest increasing subsequence in sigma} = k (0<=k<=n-1).at n=39A126065
- a(n) = A145818(2n-1).at n=35A145850
- Numbers in A152022 which are not products of terms of A152021.at n=35A152023
- Number of ways to partition 1 into distinct reduced fractions i/j with j <= n.at n=24A154888
- a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3 - 2. It may be considered a Fermat near miss by 2.at n=13A163827
- Number of binary strings of length n with equal numbers of 00001 and 10101 substrings.at n=15A164207
- Principal diagonal of the convolution array A213838.at n=14A213839
- Majority value maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..1 nX4 array.at n=3A220215
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..1 nXk array.at n=24A220217
- Numbers of the form 4^j + 9^k, for j and k >= 0.at n=37A226828
- Number of 2 X 2 0..n arrays with rows and columns in lexicographically nondecreasing order.at n=13A229795
- Number of parts in all partitions of n with largest multiplicity three.at n=31A320373
- Numbers k such that 425*2^k+1 is prime.at n=17A323113
- Number of compositions of n such that every restriction to a circular subinterval has a different sum.at n=37A325679