11598
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23208
- Proper Divisor Sum (Aliquot Sum)
- 11610
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3864
- Möbius Function
- -1
- Radical
- 11598
- 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
- 205
- 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
- Expansion of 1/((1-6x)(1-7x)(1-9x)(1-11x)).at n=3A028205
- Numbers k such that 165*2^k+1 is prime.at n=50A032459
- Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=17A034587
- 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, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=9A148793
- Sums of 3 consecutive semiprimes.at n=41A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=39A173969
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=40A200184
- Number of nX2 0..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=4A209174
- Number of nX5 0..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=1A209177
- T(n,k)=Number of nXk 0..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=16A209178
- T(n,k)=Number of nXk 0..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=19A209178
- Number of partitions p of n such that max(p)-min(p) = 7.at n=40A218570
- Number of compositions of n if all summand runs are kept together.at n=20A274174
- Number of length-n ternary words having at most 5 palindromic subwords (including the empty word).at n=33A329023
- Positive numbers k such that -k, -(k + 1), and -(k + 2) are 3 consecutive negative negaFibonacci-Niven numbers (A331088).at n=30A331090
- a(n) is the surface area of the symmetric tower described in A221529 which is a polycube whose successive terraces are the symmetric representation of sigma A000203(i) (from i = 1 to n) starting from the top and the levels of these terraces are the partition numbers A000041(h-1) (from h = 1 to n) starting from the base.at n=20A345023
- Triangle T(n,k) read by rows: T(n,k) = -binomial(n+1,k) + Sum_{i=0..k} Sum_{j=0..i+1} (i+1)^(n-i+j)*(-1)^(k-i)/(j!*(k-i)!) for 0 <= k <= n.at n=41A380179
- Number of integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums.at n=43A381717