16514
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 9406
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7876
- Möbius Function
- -1
- Radical
- 16514
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 190
- 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
- Numbers that are the sum of 4 positive 7th powers.at n=16A003371
- Numbers that are the sum of at most 4 positive 7th powers.at n=41A004866
- Numerators of continued fraction convergents to sqrt(494).at n=8A041942
- Number of primes between n^5 and (n+1)^5.at n=14A062517
- Values of z in positive integer solutions of x^2 + y^5 = z^3, listed in increasing order of z.at n=24A070067
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.at n=31A073150
- Numbers k such that 4^k + 3 is prime.at n=25A089437
- Triangle related to super-Catalan numbers (or little Schroeder numbers).at n=42A130743
- Inverse Moebius transform of the Mersenne numbers: a(n) = Sum_{d|n} (2^d - 1).at n=13A130887
- Numbers k such that 2^k + 27 is prime.at n=35A157007
- a(n) = 4^n+2^n+2.at n=7A170938
- Number of partitions p of n such that (number of even numbers in p) <= 2*(number of odd numbers in p).at n=36A241642
- Numbers k such that 3*10^k + 89 is prime.at n=21A276642
- Sequence lists numbers k > 1 such that k^2 == phi(k) (mod sigma(k)), where phi = A000010 and sigma = A000203.at n=21A324214
- a(n) = Sum_{d|n} phi(d)^(n-1).at n=7A342490
- a(n) = Sum_{k=1..n} gcd(k, n)^7.at n=3A343509
- Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = Sum_{j=1..n} gcd(j, n)^k.at n=48A343510
- Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} floor(n/j)^k.at n=48A344725
- G.f. A(x) satisfies A(x)/(1 + A(x)) = -A(x^3)/A(-x^2).at n=19A389429