11930
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21492
- Proper Divisor Sum (Aliquot Sum)
- 9562
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4768
- Möbius Function
- -1
- Radical
- 11930
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 94
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 25.at n=38A020364
- Numbers k such that k*2^k + (k+1) is prime.at n=9A046845
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=40A064975
- Interprimes which are of the form s*prime, s=10.at n=27A075285
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.at n=15A077096
- Numbers n such that sigma(n)=2n-phi(phi(n)).at n=14A110073
- Positions of 4's in A038800 with offset 1.at n=41A115095
- Integers k such that 10^k + 67 is a prime number.at n=14A135113
- a(n) = a(n-1) + a(n-2) + k, n>1; with a(0) = 1, a(1) = 2, k = 3.at n=17A171516
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two or three distinct values for every i<=n and j<=n.at n=7A211500
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=34A229467
- Expansion of (1+x)/(1+x-2*x^2-3*x^3).at n=23A250103
- Number of nX3 0..1 arrays with each 1 adjacent to 2, 3 or 4 king-move neighboring 1s.at n=5A296822
- Number of nX6 0..1 arrays with each 1 adjacent to 2, 3 or 4 king-move neighboring 1s.at n=2A296825
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 3 or 4 king-move neighboring 1s.at n=30A296827
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 3 or 4 king-move neighboring 1s.at n=33A296827
- G.f. A(x) satisfies: [x^k] (1+x)^(n*(n+1)/2) * A(x) = 0 for k = n*(n-1)/2 + 1 through k = n*(n+1)/2 for n >= 1.at n=12A305601
- Square array, read by rows. For n,d >= 0, a(n,d) is the number of congruences of the d-twisted partition monoid of degree n.at n=48A340914
- Irregular triangle read by rows: T(n,k) is the number of endofunctions on [n] whose second-largest component has size exactly k; n >= 0, 0 <= k <= floor(n/2).at n=13A350078
- Numbers k such that prime(k) and prime(k) + 9*k are anagrams.at n=43A379738