16494
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 33000
- Proper Divisor Sum (Aliquot Sum)
- 16506
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5496
- Möbius Function
- -1
- Radical
- 16494
- 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
- 97
- 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 which are the sum of their proper divisors containing the digit 4.at n=29A059463
- a(n) = floor( n^Pi ).at n=21A061294
- Antidiagonal sums of square array A082025.at n=30A082190
- Expansion of 1/((1-x)*(1-x^2)*(1-x^3)*(1-x^4))^2.at n=24A117486
- Positions of 11's in A131744.at n=6A133152
- S(n) - the sum of the areas of the polygons constructed from connecting with a straight line all identical members in the multiplicative table modulo n (finite field).at n=28A157023
- Number of nondecreasing strings of numbers x(i=1..6) in -n..n with sum x(i)^3 equal to 0.at n=37A188280
- Number of pairs (x, y) with 0 <= x, y <= n such that the distance between two points is a positive integer.at n=21A228108
- a(n) = [x^n] Product_{k=1..n} 1/(x^(2*k)*(1-x^k)^2).at n=4A258793
- Number of 5 X n 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A303317
- a(0) = 1; a(n) = a(n-1)*(b(n)+1)/(b(n)-1), where b(n) = A385958(n) is the largest prime p such that a(n) is an integer.at n=40A385959