4253
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4254
- 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
- 4252
- Möbius Function
- -1
- Radical
- 4253
- 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
- 77
- 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
- 583
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=18A000043
- From relations between Siegel theta series.at n=52A006476
- Coordination sequence T1 for Zeolite Code AFI.at n=45A008014
- Coordination sequence T4 for Zeolite Code MOR.at n=42A008185
- Quadruples of different integers from [ 2,n ] with no common factors between pairs.at n=31A015628
- Numbers k such that the continued fraction for sqrt(k) has period 25.at n=15A020364
- Smallest nonempty set S containing prime divisors of 7k+6 for each k in S.at n=51A020611
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(6,31).at n=4A022034
- Primes that remain prime through 2 iterations of the function f(x) = 2x + 7.at n=41A023244
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 4.at n=30A023253
- Primes p whose digits do not appear in p^2.at n=45A030086
- Numbers with exactly five distinct base-8 digits.at n=1A031985
- Multiplicity of highest weight (or singular) vectors associated with character chi_161 of Monster module.at n=38A034549
- Recursive prime generating sequence.at n=36A039726
- Numerators of continued fraction convergents to sqrt(180).at n=4A041332
- Primes p such that p+6 and p+8 are also primes.at n=34A046138
- Primes whose consecutive digits differ by 2 or 3.at n=32A048414
- p, p+6 and p+8 are all primes (A046138) but p+2 is not.at n=24A049438
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 5.at n=11A050954
- Prime powers such that 1 + lcm(1,2,...,p^w) is prime.at n=17A051453