4133
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4134
- 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
- 4132
- Möbius Function
- -1
- Radical
- 4133
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 157
- 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
- 569
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- A generalized partition function.at n=15A002599
- Numbers k such that the continued fraction for sqrt(k) has period 7.at n=31A010338
- Coordination sequence T7 for Zeolite Code TER.at n=43A016439
- Primes that remain prime through 2 iterations of the function f(x) = 2x + 7.at n=40A023244
- Primes that remain prime through 3 iterations of function f(x) = 2x + 7.at n=7A023275
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 7.at n=11A031420
- Number of compound rooted windmills with n nodes where any 2 submills extending from the same node are of different sizes.at n=13A032143
- Primes of form x^2+41*y^2.at n=28A033228
- Dirichlet convolution of b_n=2^(n-1) with Primes (with 1).at n=12A034736
- Number of binary rooted trees with n nodes and height exactly 6.at n=18A036595
- Numbers whose base-16 representation has exactly 4 runs.at n=19A043677
- Numbers whose base-4 representation contains exactly three 0's and three 1's.at n=14A045031
- Numbers whose base-5 representation contains exactly three 1's and two 3's.at n=31A045246
- Primes with first digit 4.at n=38A045710
- Sum of digits of prime(n) raised to its digits' powers is prime.at n=45A046440
- Triangle read by rows. Same rule as Aitken triangle (A011971) except T(0,0) = 1, T(1,0) = 2.at n=33A046937
- Sequence formed from rows of triangle A046937.at n=27A046938
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 13.at n=17A050962
- Primes with digits in alphabetical order (in English).at n=53A053434
- Third term of weak prime quintets: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=11A054825