17849
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19236
- Proper Divisor Sum (Aliquot Sum)
- 1387
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16464
- Möbius Function
- 1
- Radical
- 17849
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numerators of continued fraction convergents to sqrt(859).at n=7A042658
- Number of nonnegative integer 3 X 3 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.at n=13A054975
- Number of irreducible representations of the symmetric group S_n that have even degree.at n=35A060368
- Add/multiply sequence, see example.at n=46A093361
- a(0) = 1, a(n) = 1 + 2*3 + 4*5 + 6*7 + ... + (2n)*(2n+1) for n > 0.at n=23A098931
- A144325(n) + A144313(n) + A144315(n).at n=36A144715
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 1, 1), (0, 1, 1), (1, 0, 0), (1, 0, 1)}.at n=7A151126
- a(n) = 25*n^2 - 14*n + 2.at n=27A154357
- Number of parts of the n-th subshell of the head of the last section of the set of partitions of any odd integer >= 2n+1.at n=19A182993
- Number of non-intersecting unit cubes regularly packed into the tetrahedron of edge length n.at n=54A219965
- a(n) is the number of subsets of {1,2,...,n} with at least two elements and the difference between successive elements at least 6.at n=37A335184