16810
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 31014
- Proper Divisor Sum (Aliquot Sum)
- 14204
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6560
- Möbius Function
- 0
- Radical
- 410
- Omega Function (Ω)
- 4
- 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
- 35
- 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
- Positive integers n such that n | (2^n + n/2 + 1).at n=10A015945
- a(n) = 10*n^2.at n=41A033583
- Numbers whose base-7 representation contains exactly four 0's.at n=8A043396
- Numbers k that divide 4^k + 2^k or 8^k + 4^k.at n=43A045577
- Numbers k such that n | sigma_10(k) + phi(k)^10.at n=12A055704
- Numbers m such that pi(m^2) is a square.at n=8A064523
- a(n) = floor(average of first n cubes).at n=39A078618
- Numbers k such that the k-th difference between 2 successive primes equals the squarefree part of k.at n=28A078691
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=5.at n=13A079117
- a(n) = (3^n - 1)*(3^n + 1)^2/32.at n=4A152256
- Integer averages of the first perfect cubes up to some n^3.at n=29A164577
- Numbers n such that phi(n)/n = 16/41.at n=11A176598
- Square array read by antidiagonals: T(m,n) = number of spanning trees in C_m X C_n.at n=16A212796
- Square array read by antidiagonals: T(m,n) = number of spanning trees in C_m X C_n.at n=19A212796
- Number of spanning trees in C_2 X C_n.at n=4A212797
- Number of (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| != w+x+y.at n=25A213480
- A bisection of A183168.at n=38A215933
- Numbers of the form 3^j + 7^k, for j and k >= 0.at n=45A226816
- The least positive integer in A055744 divisible by A008578(n).at n=13A256430
- Numbers A055744(n) such that for any k < n, A055744(k) and A055744(n) do not have all their prime factors in common.at n=15A256431