4029
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 1731
- 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
- 2496
- Möbius Function
- -1
- Radical
- 4029
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 95
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- 4-dimensional analog of centered polygonal numbers. Also number of regions created by sides and diagonals of a convex n-gon in general position.at n=19A006522
- Number of regions in regular n-gon with all diagonals drawn.at n=18A007678
- Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578).at n=45A014284
- a(n) = n*(7*n - 1)/2.at n=34A022264
- Expansion of 1/Product_{m>=1} (1 - m*q^m)^12.at n=4A022736
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=33A024854
- Number of partitions of n that do not contain 6 as a part.at n=30A027340
- Numbers k such that 99*2^k+1 is prime.at n=33A032399
- a(n) = (2*n - 1)*(3*n + 1).at n=26A033569
- Concatenations C1 and C2 are both prime (see the comment lines).at n=43A034816
- a(n)=T(n,n+3), array T as in A049723.at n=34A049731
- Number of primes between successive Fibonacci numbers exclusive.at n=24A052011
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(17)).at n=41A052479
- One-sixth the area of the smallest primitive d-arithmetic triangle, where d=A072330(n).at n=15A072360
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 3), divided by 3.at n=30A073360
- Number of primes between successive Fibonacci numbers inclusive.at n=25A076777
- a(0) = 1; for n > 1, a(n) = smallest number > a(n-1) such that a(n) + a(k) is squarefree for k = 1 to n-1.at n=49A077224
- Final terms of rows in A077341.at n=39A077343
- Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1.at n=22A079161
- Number of primes between successive Fibonacci numbers (including possibly the Fibonacci numbers themselves).at n=24A082602