11590
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 10730
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 1
- Radical
- 11590
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 143
- 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
- 12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10*n-7)/6.at n=19A007587
- Fibonacci sequence beginning 0, 19.at n=15A022353
- Quasi-Carmichael numbers to base -2: squarefree composites n such that for every prime p that divides n, p+2 divides n+2.at n=2A029562
- Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.at n=24A065255
- A Collatz-Fibonacci mixture: a(1) = 1, a(2) = 2, a(n+2) = a(n+1)/2+a(n)/2 if a(n+1) and a(n) have the same parity, a(n+2) = a(n+1)+a(n) otherwise.at n=40A069202
- Second row of array in A101385.at n=19A101644
- a(n) = n*(8*n+1).at n=38A139275
- 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, 0, 0), (0, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150800
- Total sum of parts greater than 1 in all the partitions of n except one copy of the smallest part greater than 1 of every partition.at n=20A196025
- a(n) = smallest k having at least four prime divisors d such that (d + n) | (k + n).at n=1A202159
- Number of (w,x,y) with all terms in {0,...,n} and w<=x+y and x<=y.at n=29A212983
- Even Quasi-Carmichael numbers.at n=2A262252
- Breadth-first traversal of a binary tree in which the value at the n-th node is equal to ParentNode()*prime(n-1).at n=18A268878
- Numbers k such that (86*10^k - 221)/9 is prime.at n=18A288823
- Expansion of Product_{k>0} (Sum_{m>=0} x^(k*m^2)).at n=51A300446
- Expansion of Sum_{k>=0} x^(k*(k+1)/2) / Product_{j=1..k} (1 + j*x^j).at n=30A306704
- Number of prime parts in the partitions of n into 6 parts.at n=48A309433
- Indices of primes followed by a gap (distance to next larger prime) of 32.at n=38A320714
- Number of binary relations R on [n] such that q(R) is a quasi-order and s(R) is a strict partial order (where q(R) and s(R) are defined below).at n=4A369799