17452
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 30548
- Proper Divisor Sum (Aliquot Sum)
- 13096
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8724
- Möbius Function
- 0
- Radical
- 8726
- Omega Function (Ω)
- 3
- 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
- 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
- Diagonally symmetric (about diagonal 2) 2n-celled polyominoes with 1 hole.at n=14A057424
- Number of nX3 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=4A203596
- Number of nX5 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=2A203598
- T(n,k)=Number of nXk 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=23A203600
- T(n,k)=Number of nXk 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=25A203600
- Numbers k such that k+x+y is a perfect cube, where x and y are the two cubes nearest to k.at n=12A238599
- Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.at n=49A239964
- Numbers n such that (6k-1) for k=n, n+1, n+2, n+3 are all primes with no primes of the form (6k+1) in between.at n=19A296011
- a(1) = 1; thereafter a(n) is the smallest number > a(n-1) which is neither of the form 2*a(i) nor Sum_{j=1..n-1} ( b_j*a(j) ) where 0 < i < n, b_j = 0 or 1.at n=17A331800
- Numbers k such that the k-th composition in standard order is a non-alternating permutation of an initial interval of positive integers.at n=37A350250
- Number of partitions of n with rank 4 or higher (the rank of a partition is the largest part minus the number of parts).at n=41A363231