4062
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8136
- Proper Divisor Sum (Aliquot Sum)
- 4074
- 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
- 1352
- Möbius Function
- -1
- Radical
- 4062
- 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
- 64
- 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
- yes
- Odd
- no
Appears in sequences
- 'Eban' numbers (the letter 'e' is banned!).at n=56A006933
- Number of partitions satisfying (cn(0,5) = cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=50A036821
- Smallest k for which k, 2k, ... n*k all contain the digit 2.at n=6A039933
- Smallest k for which k, 2k, ... n*k all contain the digit 2.at n=7A039933
- Numbers having four 2's in base 5.at n=21A043360
- a(n)=T(2n-1,n), array T given by A048212.at n=33A048221
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.at n=25A049725
- Number of distinct non-extendable sequences X={x(1),x(2),...,x(k)} where x(1)=1, the x(i)'s are distinct elements of {1,...,n} with |x(i)-x(i+1)|=1 or 2, for i=1,2,...,k.at n=13A054668
- Numbers k such that 2^k + 3 is prime.at n=27A057732
- An approximation to sigma_{5/2}(n): floor( sum_{d|n} d^(5/2) ).at n=25A058272
- McKay-Thompson series of class 15A for Monster.at n=13A058508
- F(n)*2^n - 1 is prime, where F(n) is the n-th Fibonacci number.at n=13A059501
- Numbers k such that 2^k - 17 is prime.at n=26A059611
- Numbers k such that k*prime(k) -+ 1 are twin primes.at n=25A085637
- Bisection of A088567.at n=44A088585
- a(n) = prime(4n-3) + prime(4n-2) + prime(4n-1) + prime(4n).at n=42A094207
- a(n) = 2^(n+2) - 3*n - 4.at n=9A095264
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=24A111045
- a(n) = 1 + sum{p=primes<n, p does not divide n} a(p).at n=38A112479
- Sum of the first n n-digit primes.at n=3A119491