11599
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13264
- Proper Divisor Sum (Aliquot Sum)
- 1665
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9936
- Möbius Function
- 1
- Radical
- 11599
- 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
- 205
- 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
- Number of mappings from n points to themselves with in-degree <= 2.at n=12A006961
- Numbers k such that Fib(k) == -13 (mod k).at n=39A023167
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=35A031899
- Lucky numbers that are the sum of the first k primes for some k.at n=8A046286
- Number of + signs needed to write the partitions of n (A000041) as sums.at n=24A076276
- (2n+1)-digit anti-palindromic numbers or numberdromes, whose first and last digits add to ten, second and next-to-last add to ten and so on with the central digit a 5.at n=9A093472
- A Binet like formula using the Akiyama-Thurston tile roots for a Minimal Pisot theta0 sequence.at n=34A097600
- Sum of first 2n primes.at n=36A109722
- Sum of primes < n^2.at n=19A139562
- a(n) = 400*n - 1.at n=28A158317
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having exactly k blocks that do not consist of consecutive integers (0<=k<=floor(n/2); a singleton is considered a block of consecutive integers).at n=41A177256
- Numbers n such that 30n+{11, 13, 17, 19, 23} are 5 consecutive primes.at n=18A182279
- Where powers of 2 occur in the union of squares and powers of 2.at n=27A188917
- Semiprimes in A007504 (the sum of first n primes).at n=21A189072
- Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes.at n=12A263510
- Sum of the first n*(n+1) primes.at n=8A322420
- Number of n-celled quasi still lifes in Conway's Game of Life, up to rotation and reflection.at n=14A330283
- Number of integer compositions of n with product n.at n=30A335405
- The sum S of the maximum number of consecutive primes starting with 2 such that S <= prime(n)^2.at n=28A346134
- Polygonal numbers of order greater than 2 (A090466) which are the sum of the first k primes, for some k > 0.at n=43A364694