11390
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
- 16
- Divisor Sum
- 22032
- Proper Divisor Sum (Aliquot Sum)
- 10642
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 1
- Radical
- 11390
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 174
- 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
- a(n) = floor(2nd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=42A025212
- Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).at n=14A063968
- Number of 4-colorable (i.e., chromatic number <= 4) simple graphs on n nodes.at n=7A076316
- Floor(n^3/8).at n=45A081276
- Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6*k+5 for some k, where prime(n) denotes n-th prime.at n=22A090835
- Numbers k such that (273*2^k+1)^2-2 is prime.at n=24A100914
- Indices of primes in sequence defined by A(0) = 69, A(n) = 10*A(n-1) - 41 for n > 0.at n=6A101530
- Numbers n such that 9*10^n + 4*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=7A103098
- Intersection of A108027, A108028, A108029 and A108030.at n=5A108109
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, 0), (1, -1, 1), (1, 0, -1)}.at n=9A148400
- 5 times hexagonal numbers: 5*n*(2*n-1).at n=34A152745
- a(n) = A000930(n) + A000930(n+3) + 4.at n=22A170933
- Numbers n such that 10^n - 69 is prime.at n=22A177866
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=39A191111
- Number of (n+1)X(n+1) -11..11 symmetric matrices with every 2X2 subblock having sum zero and three distinct values.at n=6A211711
- a(n) = floor((n + 1/2)^3).at n=22A219085
- Twice partitioned numbers where the first partition is strict.at n=16A271619
- Numbers missing from A317415.at n=11A317417
- a(n) is the smallest k such that exactly one of k*2^(2^n) - 2*k + 1 and k*2^(2^n) + 2*k - 1 is a prime.at n=16A332847
- Ulam numbers that are products of exactly four distinct primes (or tetraprimes).at n=35A379532