16464
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 49600
- Proper Divisor Sum (Aliquot Sum)
- 33136
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4704
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 8
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 128
- 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
- Number of 2n-step 2-dimensional closed self-avoiding paths on square lattice.at n=6A010566
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*12^j.at n=11A038278
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*7^j.at n=13A038333
- Sums of 3 distinct powers of 4.at n=40A038471
- Numbers k such that if p_1,p_2,...,p_m, m>1, are the prime factors of k, then there is some b>0 such that k = Sum_{i=1..m} b^(p_i).at n=3A058040
- Numbers k such that sigma (x) = k has exactly 12 solutions.at n=16A060676
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.at n=13A061662
- a(n) = 21*n^2.at n=28A064762
- Numbers whose product of exponents is equal to the sum of prime factors.at n=24A071175
- Number of elements of GF(7^n) with trace 0 and subtrace 3.at n=6A074016
- Square of Narayana triangle A001263: View A001263 as a lower triangular matrix. Then the square of that matrix is also lower triangular. Sequence gives this lower triangle, read by rows.at n=41A095801
- Numbers whose set of base 7 digits is {0,6}.at n=24A097253
- Number of primitive roots modulo prime(n)^2, where prime(n) is n-th prime.at n=44A104039
- a(n) = (n-3)*2^n + n*(n+3)/2 + 3.at n=10A104747
- Hamming weight enumerator of a certain code over GF(4).at n=12A105915
- a(n) = (n+1)*(n+2)^3*(n+3)^2*(n+4)*(3n+5)/1440.at n=5A107968
- Number of partitions of 1 into distinct fractions i/j with 1<=i<j<=n and i,j coprime.at n=24A116084
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+2401)^2 = y^2.at n=13A118630
- a(n) = n^5 - n^3.at n=7A133754
- a(n) = prime(n)^5 - prime(n)^3.at n=3A138406