11563
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11968
- Proper Divisor Sum (Aliquot Sum)
- 405
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11160
- Möbius Function
- 1
- Radical
- 11563
- 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
- 143
- 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
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=20A014563
- Pseudoprimes to base 88.at n=43A020216
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=16A045277
- a(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).at n=33A056789
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=7A076164
- Numbers n such that n divides Sum_{m=1..n} (m+1)!.at n=12A100083
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=21A116037
- a(n) = (n^3 - 3n^2 + 14n - 6)/6.at n=41A180415
- Position of 2^n in A051037 (5-smooth numbers).at n=61A188425
- Combined weight, as defined at A234094, of the partitions of n.at n=14A234097
- a(n) = 7*n^2 - 5*n + 1.at n=41A239449
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=33A245208
- Numbers k such that 7*R_k - 50 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A256726
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=30A272421
- Sum of the seventh largest parts in the partitions of n into 9 parts.at n=43A326467