4111
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4112
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4110
- Möbius Function
- -1
- Radical
- 4111
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 38
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 566
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=32A005576
- Coordination sequence T5 for Zeolite Code MEL.at n=41A008154
- Primes that contain digits 1 and 4 only.at n=2A020452
- Describe the previous term! (method B - initial term is 4).at n=2A022500
- Smallest prime having least positive primitive root n, or 0 if no such prime exists.at n=11A023048
- Primes that remain prime through 3 iterations of function f(x) = 3x + 10.at n=28A023280
- Primes that remain prime through 3 iterations of function f(x) = 9x + 4.at n=15A023297
- Primes that remain prime through 4 iterations of function f(x) = 9x + 4.at n=7A023325
- Primes that remain prime through 5 iterations of the function f(x) = 9x + 4.at n=3A023353
- a(n) = diagonal sum of left-justified array T given by A027052.at n=24A027069
- Sequence satisfies T^2(a)=a, where T is defined below.at n=49A027585
- a(n) is the least prime > a(n-1) whose digits do not appear in a(n-1).at n=20A030284
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 63.at n=12A031561
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=0A031828
- Upper prime of a difference of 12 between consecutive primes.at n=41A031931
- Lower prime of a pair of consecutive primes having a difference of 16.at n=13A031934
- Numbers whose set of base-10 digits is {1,4}.at n=22A032822
- Primes of form x^2+83*y^2.at n=29A033253
- Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=30A035974
- Smallest n-digit prime containing only digits 1 and 4, or 0 if no such prime exists.at n=3A036931