11593
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11594
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11592
- Möbius Function
- -1
- Radical
- 11593
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 187
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1395
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Bitriangular permutations.at n=6A006230
- Number of compositions (ordered partitions) of n into squares.at n=29A006456
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=81A013583
- a(1)=1, a(n) = n*14^(n-1) + a(n-1).at n=3A014929
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=18A031830
- Sizes of successive balls in D_4 lattice.at n=34A046949
- n consecutive primes differ by a multiple of 4 starting at a(n).at n=6A054678
- n consecutive primes differ by a multiple of 4 starting at a(n).at n=7A054678
- Fourth term of strong prime quintets: p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m).at n=29A054811
- First occurrence of run of primes congruent to 1 mod 4 of exactly length n.at n=8A055623
- a(n) = 1 + 2*n + 3*n^2 + 4*n^3.at n=14A056578
- Initial prime in first sequence of n primes congruent to 1 modulo 4.at n=7A057624
- Initial prime in first sequence of n primes congruent to 1 modulo 4.at n=6A057624
- Initial prime in first sequence of n primes congruent to 1 modulo 4.at n=8A057624
- Initial prime in first sequence of n primes congruent to 1 modulo 4.at n=5A057624
- McKay-Thompson series of class 42A for Monster.at n=50A058671
- Primes p(k) such that the product of digits of p(k) equals the product of digits of k.at n=13A066521
- Number of permutations satisfying i-2<=p(i)<=i+6, i=1..n.at n=9A072853
- Smallest prime p such that sum of p and the next n-1 primes is a perfect square, or 1 if no such prime exists.at n=41A073887
- Iccanartet sequence: a(n)=R[a(n-1)]+R[a(n-2)]+R[a(n-3)]+R[a(n-4)] where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.at n=13A074862