17874
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 39840
- Proper Divisor Sum (Aliquot Sum)
- 21966
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5940
- Möbius Function
- 0
- Radical
- 1986
- Omega Function (Ω)
- 5
- 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
- 97
- 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 bipartite partitions of n white objects and 5 black ones.at n=14A000491
- Irregular triangle read by rows: T(n,k) = number of directed graphs-with-loops with n nodes and k arcs (n >= 0, 0 <= k <= n^2).at n=44A046858
- Irregular triangle read by rows: T(n,k) = number of directed graphs-with-loops with n nodes and k arcs (n >= 0, 0 <= k <= n^2).at n=51A046858
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=a(n-1,n-1), a(n,k)=a(n,k-1) + Sum_{i=0..k-1} a(n-1,i).at n=23A108041
- Sum of the lengths of the first ascents in all n-length left factors of Dyck paths.at n=14A191782
- a(n) = A194588(n) - A005043(n); complementary Riordan numbers.at n=12A194589
- Indices of primes in the tribonacci-like sequence, A214825.at n=27A230016
- Numbers k such that if x = Sum_{j|k, j<k} (sigma(j) - j) then k = Sum_{j|x, j<x} (sigma(j) - j).at n=4A238765
- a(n) is the number of equivalence classes of simple, open polygonal chains consisting of two segments and with all three vertices on the lattice points of an n X n grid.at n=13A272053
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=29A274234
- First term of n-th difference sequence of (floor(k*r)), r = sqrt(6), k >= 0.at n=16A325670
- Numbers that are the sum of five fourth powers in three or more ways.at n=21A344243
- Numbers that are the sum of five fourth powers in exactly three ways.at n=21A344244
- Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.at n=21A385339