4095
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 4641
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1728
- Möbius Function
- 0
- Radical
- 1365
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=12A000225
- Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m).at n=10A000236
- a(n) = 4*n^2 - 1.at n=32A000466
- Number of 2n-bead balanced binary necklaces of fundamental period 2n, equivalent to reversed complement; also Dirichlet convolution of b_n=2^(n-1) with mu(n); also number of components of Mandelbrot set corresponding to Julia sets with an attractive n-cycle.at n=12A000740
- Generalized Euler phi function (for p=2).at n=12A003473
- Divisors of 2^12 - 1.at n=23A003524
- Divisors of 2^24 - 1.at n=47A003532
- Binomial coefficient C(7n,n-11).at n=2A004379
- Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m).at n=5A005231
- Number of exterior points formed by extending diagonals of n-gon in general position.at n=12A005701
- Primitive pseudoperfect numbers.at n=56A006036
- Odd primitive abundant numbers.at n=4A006038
- Solution to a Diophantine equation: each term is a triangular number and each term + 1 is a square.at n=5A006454
- a(n) = n*(n + 1)*(n^2 - 3*n + 5)/6.at n=13A006484
- Molien series for cyclic group of order 5.at n=24A008646
- Stirling numbers of second kind S2(13,n).at n=1A011562
- a(n) = floor(C(n,4)/5).at n=28A011795
- Number of Barlow packings with group P63/mmc(S) that repeat after 4n layers.at n=12A011946
- exp(arctanh(x)+arcsinh(x)) = 1+2*x+4/2!*x^2+9/3!*x^3+24/4!*x^4+105/5!*x^5...at n=7A013183
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=24A013592