11140
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23436
- Proper Divisor Sum (Aliquot Sum)
- 12296
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4448
- Möbius Function
- 0
- Radical
- 5570
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 10000*log_10(n) rounded up.at n=12A004230
- Numbers k such that sigma(k) = sigma(k+12).at n=38A015882
- Susceptibility series H_2 for 2-dimensional Ising model (divided by 2).at n=45A054275
- Interprimes which are of the form s*prime, s=20.at n=12A075295
- Triangle T(n, k) read by rows; given by [0, 1, 0, 2, 0, 3, 0, 4, ...] DELTA [1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 4, 0, 2, 0, ...] (A000005 interspersed with 0's) where DELTA is Deléham's operator defined in A084938.at n=48A085852
- G.f. satisfies: A(x) = 1/(1 + x*A(x^2)) and also the continued fraction: 1 + x*A(x^3) = [1; 1/x, 1/x^2, 1/x^4, 1/x^8, ..., 1/x^(2^(n-1)), ...].at n=43A101912
- Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes.at n=38A105720
- Indices n such that A134204(n) < n.at n=18A133242
- Numbers k such that 10^k*(2+3*10^k)+3 is prime.at n=17A171249
- Triangular array read by rows. T(n,k) is the number of simple unlabeled graphs with n nodes having exactly k distinct components.at n=15A182223
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=14A191111
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z.at n=30A212068
- Number of (n+1) X (n+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=5A234258
- Number of (n+1) X (6+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=5A234264
- Number of binary strings of length n that are powers of shorter strings, but cannot be written as the concatenation of two or more such strings.at n=27A265648
- a(n) = n + (n base 2 regarded as a decimal number).at n=30A269130
- Numbers n such that Bernoulli number B_{n} has denominator 330.at n=30A272183
- Number of connected dominating sets in the n X n knight graph.at n=3A291705
- O.g.f. A(x) satisfies: [x^n] exp( n * x*A(x) ) * (n + 3 - A(x)) = 0 for n > 0.at n=4A305113
- Largest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=44A308904