11371
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11592
- Proper Divisor Sum (Aliquot Sum)
- 221
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11152
- Möbius Function
- 1
- Radical
- 11371
- 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
- 81
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=29A020425
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=41A027865
- Composite numbers which contain their largest proper divisor as a substring.at n=5A062238
- Integer part of log(n!)^(1 + log(log(1 + n))).at n=27A062475
- Nearest integer to log(n!)^(1 + log(log(1 + n))).at n=27A062476
- Numbers k such that the decimal encoding of the prime factorization of k (A067599) ends in k.at n=2A067254
- a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.at n=4A075028
- a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.at n=5A075028
- Numbers n such that (n + prime(n)), (n+1 + prime(n+1)), (n+2 + prime(n+2)) and (n+3 + prime(n+3)) are divisible by 5.at n=3A107582
- Dropping first and last digit of n leaves its largest prime factor.at n=39A114565
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=39A117725
- Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number.at n=18A118559
- Composite numbers, not ending with 0, sharing a 3-digit sequence with some of its prime factors.at n=5A131523
- a(n) = number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring of length >= 2 in place.at n=35A135156
- a(n) is the largest k in an n_nacci(k) sequence (Fibonacci(k) for n=2, tribonacci(k) for n=3, etc.) such that n_nacci(k) >= 2^(k-n-1).at n=11A202805
- Number of partitions p of n such that the multiplicity of 2*min(p) is a part.at n=38A240496
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 459", based on the 5-celled von Neumann neighborhood.at n=25A272289
- a(n) is the minimum number that is the first of n consecutive integers with an increasing number of divisors.at n=5A284596
- Numbers that are the sum of eight fifth powers in two or more ways.at n=33A345610
- Numbers that are the sum of eight fifth powers in exactly two ways.at n=33A346327